Theory of automata:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Oxford
Pergamon Press
[1969]
|
| Ausgabe: | [1st ed.] |
| Schriftenreihe: | International series of monographs in pure and applied mathematics
v. 100 |
| Schlagworte: | |
| Online-Zugang: | FAW01 Volltext |
| Beschreibung: | Includes bibliographical references (pages 247-252) Theory of Automata deals with mathematical aspects of the theory of automata theory, with emphasis on the finite deterministic automaton as the basic model. All other models, such as finite non-deterministic and probabilistic automata as well as pushdown and linear bounded automata, are treated as generalizations of this basic model. The formalism chosen to describe finite deterministic automata is that of regular expressions. A detailed exposition regarding this formalism is presented by considering the algebra of regular expressions |
| Beschreibung: | xii, 263 pages |
| ISBN: | 9780080133768 0080133762 9781483154398 1483154394 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044386475 | ||
| 003 | DE-604 | ||
| 005 | 20220114 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170630s1969 |||| o||u| ||||||eng d | ||
| 020 | |a 9780080133768 |9 978-0-08-013376-8 | ||
| 020 | |a 0080133762 |9 0-08-013376-2 | ||
| 020 | |a 9781483154398 |9 978-1-4831-5439-8 | ||
| 020 | |a 1483154394 |9 1-4831-5439-4 | ||
| 035 | |a (ZDB-33-ESD)ocn643795108 | ||
| 035 | |a (OCoLC)643795108 | ||
| 035 | |a (DE-599)BVBBV044386475 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 629.8/9 | |
| 082 | 0 | |a 001.53 |2 18eng | |
| 100 | 1 | |a Salomaa, Arto |d 1934- |e Verfasser |0 (DE-588)121031764 |4 aut | |
| 245 | 1 | 0 | |a Theory of automata |
| 250 | |a [1st ed.] | ||
| 264 | 1 | |a Oxford |b Pergamon Press |c [1969] | |
| 300 | |a xii, 263 pages | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a International series of monographs in pure and applied mathematics |v v. 100 | |
| 500 | |a Includes bibliographical references (pages 247-252) | ||
| 500 | |a Theory of Automata deals with mathematical aspects of the theory of automata theory, with emphasis on the finite deterministic automaton as the basic model. All other models, such as finite non-deterministic and probabilistic automata as well as pushdown and linear bounded automata, are treated as generalizations of this basic model. The formalism chosen to describe finite deterministic automata is that of regular expressions. A detailed exposition regarding this formalism is presented by considering the algebra of regular expressions | ||
| 650 | 7 | |a Machines séquentielles, Théorie des |2 ram | |
| 650 | 7 | |a Formal languages |2 fast | |
| 650 | 7 | |a Power series |2 fast | |
| 650 | 7 | |a Sequential machine theory |2 fast | |
| 650 | 7 | |a REFERENCE / Questions & Answers |2 bisacsh | |
| 650 | 4 | |a Sequential machine theory | |
| 650 | 4 | |a Formal languages | |
| 650 | 4 | |a Power series | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780080133768 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029788696 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9780080133768 |l FAW01 |p ZDB-33-ESD |q FAW_PDA_ESD |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804177654546432000 |
|---|---|
| any_adam_object | |
| author | Salomaa, Arto 1934- |
| author_GND | (DE-588)121031764 |
| author_facet | Salomaa, Arto 1934- |
| author_role | aut |
| author_sort | Salomaa, Arto 1934- |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV044386475 |
| collection | ZDB-33-ESD |
| ctrlnum | (ZDB-33-ESD)ocn643795108 (OCoLC)643795108 (DE-599)BVBBV044386475 |
| dewey-full | 629.8/9 001.53 |
| dewey-hundreds | 600 - Technology (Applied sciences) 000 - Computer science, information, general works |
| dewey-ones | 629 - Other branches of engineering 001 - Knowledge |
| dewey-raw | 629.8/9 001.53 |
| dewey-search | 629.8/9 001.53 |
| dewey-sort | 3629.8 19 |
| dewey-tens | 620 - Engineering and allied operations 000 - Computer science, information, general works |
| discipline | Allgemeines Mess-/Steuerungs-/Regelungs-/Automatisierungstechnik / Mechatronik |
| edition | [1st ed.] |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02524nmm a2200553zcb4500</leader><controlfield tag="001">BV044386475</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220114 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170630s1969 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080133768</subfield><subfield code="9">978-0-08-013376-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080133762</subfield><subfield code="9">0-08-013376-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781483154398</subfield><subfield code="9">978-1-4831-5439-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1483154394</subfield><subfield code="9">1-4831-5439-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-ESD)ocn643795108</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)643795108</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044386475</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">629.8/9</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.53</subfield><subfield code="2">18eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Salomaa, Arto</subfield><subfield code="d">1934-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121031764</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of automata</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">[1st ed.]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford</subfield><subfield code="b">Pergamon Press</subfield><subfield code="c">[1969]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 263 pages</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">International series of monographs in pure and applied mathematics</subfield><subfield code="v">v. 100</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 247-252)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Theory of Automata deals with mathematical aspects of the theory of automata theory, with emphasis on the finite deterministic automaton as the basic model. All other models, such as finite non-deterministic and probabilistic automata as well as pushdown and linear bounded automata, are treated as generalizations of this basic model. The formalism chosen to describe finite deterministic automata is that of regular expressions. A detailed exposition regarding this formalism is presented by considering the algebra of regular expressions</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machines séquentielles, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Formal languages</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Power series</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Sequential machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">REFERENCE / Questions & Answers</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequential machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Power series</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780080133768</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029788696</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780080133768</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FAW_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044386475 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:51:31Z |
| institution | BVB |
| isbn | 9780080133768 0080133762 9781483154398 1483154394 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029788696 |
| oclc_num | 643795108 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | xii, 263 pages |
| psigel | ZDB-33-ESD ZDB-33-ESD FAW_PDA_ESD |
| publishDate | 1969 |
| publishDateSearch | 1969 |
| publishDateSort | 1969 |
| publisher | Pergamon Press |
| record_format | marc |
| series2 | International series of monographs in pure and applied mathematics |
| spelling | Salomaa, Arto 1934- Verfasser (DE-588)121031764 aut Theory of automata [1st ed.] Oxford Pergamon Press [1969] xii, 263 pages txt rdacontent c rdamedia cr rdacarrier International series of monographs in pure and applied mathematics v. 100 Includes bibliographical references (pages 247-252) Theory of Automata deals with mathematical aspects of the theory of automata theory, with emphasis on the finite deterministic automaton as the basic model. All other models, such as finite non-deterministic and probabilistic automata as well as pushdown and linear bounded automata, are treated as generalizations of this basic model. The formalism chosen to describe finite deterministic automata is that of regular expressions. A detailed exposition regarding this formalism is presented by considering the algebra of regular expressions Machines séquentielles, Théorie des ram Formal languages fast Power series fast Sequential machine theory fast REFERENCE / Questions & Answers bisacsh Sequential machine theory Formal languages Power series Automatentheorie (DE-588)4003953-5 gnd rswk-swf Automatentheorie (DE-588)4003953-5 s 1\p DE-604 http://www.sciencedirect.com/science/book/9780080133768 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Salomaa, Arto 1934- Theory of automata Machines séquentielles, Théorie des ram Formal languages fast Power series fast Sequential machine theory fast REFERENCE / Questions & Answers bisacsh Sequential machine theory Formal languages Power series Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4003953-5 |
| title | Theory of automata |
| title_auth | Theory of automata |
| title_exact_search | Theory of automata |
| title_full | Theory of automata |
| title_fullStr | Theory of automata |
| title_full_unstemmed | Theory of automata |
| title_short | Theory of automata |
| title_sort | theory of automata |
| topic | Machines séquentielles, Théorie des ram Formal languages fast Power series fast Sequential machine theory fast REFERENCE / Questions & Answers bisacsh Sequential machine theory Formal languages Power series Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | Machines séquentielles, Théorie des Formal languages Power series Sequential machine theory REFERENCE / Questions & Answers Automatentheorie |
| url | http://www.sciencedirect.com/science/book/9780080133768 |
| work_keys_str_mv | AT salomaaarto theoryofautomata |