Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
1989
|
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert |
| Physical Description: | 1 Online-Ressource (XXII, 316 p) |
| ISBN: | 9781461388531 9781461388555 |
| DOI: | 10.1007/978-1-4613-8853-1 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV042420755 | ||
| 003 | DE-604 | ||
| 005 | 20151117 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s1989 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461388531 |c Online |9 978-1-4613-8853-1 | ||
| 020 | |a 9781461388555 |c Print |9 978-1-4613-8855-5 | ||
| 024 | 7 | |a 10.1007/978-1-4613-8853-1 |2 doi | |
| 035 | |a (OCoLC)1184499668 | ||
| 035 | |a (DE-599)BVBBV042420755 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 518 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Büchi, Julius Richard |d 1924-1984 |e Verfasser |0 (DE-588)118898876 |4 aut | |
| 245 | 1 | 0 | |a Finite Automata, Their Algebras and Grammars |b Towards a Theory of Formal Expressions |c by J. Richard Büchi ; edited by Dirk Siefkes |
| 264 | 1 | |a New York, NY |b Springer New York |c 1989 | |
| 300 | |a 1 Online-Ressource (XXII, 316 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Computational Mathematics and Numerical Analysis | |
| 650 | 4 | |a Robotics and Automation | |
| 650 | 4 | |a Mathematical Logic and Formal Languages | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Endlicher Automat |0 (DE-588)4224518-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Sequenzielle Logik |0 (DE-588)4323079-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Sequenzielle Logik |0 (DE-588)4323079-9 |D s |
| 689 | 0 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Endlicher Automat |0 (DE-588)4224518-7 |D s |
| 689 | 1 | 1 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Siefkes, Dirk |d 1938-2016 |e Sonstige |0 (DE-588)10682726X |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4613-8853-1 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |n DHB | |
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 940 | 1 | |q DHB_BSB_GNDPERS_I | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856172 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804153093054529536 |
|---|---|
| any_adam_object | |
| author | Büchi, Julius Richard 1924-1984 |
| author_GND | (DE-588)118898876 (DE-588)10682726X |
| author_facet | Büchi, Julius Richard 1924-1984 |
| author_role | aut |
| author_sort | Büchi, Julius Richard 1924-1984 |
| author_variant | j r b jr jrb |
| building | Verbundindex |
| bvnumber | BV042420755 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)1184499668 (DE-599)BVBBV042420755 |
| dewey-full | 518 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 518 - Numerical analysis |
| dewey-raw | 518 |
| dewey-search | 518 |
| dewey-sort | 3518 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-1-4613-8853-1 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03731nmm a2200625zc 4500</leader><controlfield tag="001">BV042420755</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20151117 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s1989 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461388531</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4613-8853-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461388555</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-8855-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4613-8853-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1184499668</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420755</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-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Büchi, Julius Richard</subfield><subfield code="d">1924-1984</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118898876</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finite Automata, Their Algebras and Grammars</subfield><subfield code="b">Towards a Theory of Formal Expressions</subfield><subfield code="c">by J. Richard Büchi ; edited by Dirk Siefkes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer New York</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXII, 316 p)</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="500" ind1=" " ind2=" "><subfield code="a">The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematics and Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robotics and Automation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Logic and Formal Languages</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Sequenzielle Logik</subfield><subfield code="0">(DE-588)4323079-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Sequenzielle Logik</subfield><subfield code="0">(DE-588)4323079-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="689" ind1="1" ind2="0"><subfield code="a">Endlicher Automat</subfield><subfield code="0">(DE-588)4224518-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Siefkes, Dirk</subfield><subfield code="d">1938-2016</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)10682726X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4613-8853-1</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="n">DHB</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">DHB_BSB_GNDPERS_I</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856172</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="883" ind1="1" ind2=" "><subfield code="8">2\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></record></collection> |
| id | DE-604.BV042420755 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:07Z |
| institution | BVB |
| isbn | 9781461388531 9781461388555 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856172 |
| oclc_num | 1184499668 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (XXII, 316 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive DHB_BSB_GNDPERS_I |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| publisher | Springer New York |
| record_format | marc |
| spelling | Büchi, Julius Richard 1924-1984 Verfasser (DE-588)118898876 aut Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions by J. Richard Büchi ; edited by Dirk Siefkes New York, NY Springer New York 1989 1 Online-Ressource (XXII, 316 p) txt rdacontent c rdamedia cr rdacarrier The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert Mathematics Computer science Computer science / Mathematics Combinatorics Computational Mathematics and Numerical Analysis Robotics and Automation Mathematical Logic and Formal Languages Informatik Mathematik Endlicher Automat (DE-588)4224518-7 gnd rswk-swf Sequenzielle Logik (DE-588)4323079-9 gnd rswk-swf Automatentheorie (DE-588)4003953-5 gnd rswk-swf Sequenzielle Logik (DE-588)4323079-9 s Automatentheorie (DE-588)4003953-5 s 1\p DE-604 Endlicher Automat (DE-588)4224518-7 s 2\p DE-604 Siefkes, Dirk 1938-2016 Sonstige (DE-588)10682726X oth https://doi.org/10.1007/978-1-4613-8853-1 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Büchi, Julius Richard 1924-1984 Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions Mathematics Computer science Computer science / Mathematics Combinatorics Computational Mathematics and Numerical Analysis Robotics and Automation Mathematical Logic and Formal Languages Informatik Mathematik Endlicher Automat (DE-588)4224518-7 gnd Sequenzielle Logik (DE-588)4323079-9 gnd Automatentheorie (DE-588)4003953-5 gnd |
| subject_GND | (DE-588)4224518-7 (DE-588)4323079-9 (DE-588)4003953-5 |
| title | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions |
| title_auth | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions |
| title_exact_search | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions |
| title_full | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions by J. Richard Büchi ; edited by Dirk Siefkes |
| title_fullStr | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions by J. Richard Büchi ; edited by Dirk Siefkes |
| title_full_unstemmed | Finite Automata, Their Algebras and Grammars Towards a Theory of Formal Expressions by J. Richard Büchi ; edited by Dirk Siefkes |
| title_short | Finite Automata, Their Algebras and Grammars |
| title_sort | finite automata their algebras and grammars towards a theory of formal expressions |
| title_sub | Towards a Theory of Formal Expressions |
| topic | Mathematics Computer science Computer science / Mathematics Combinatorics Computational Mathematics and Numerical Analysis Robotics and Automation Mathematical Logic and Formal Languages Informatik Mathematik Endlicher Automat (DE-588)4224518-7 gnd Sequenzielle Logik (DE-588)4323079-9 gnd Automatentheorie (DE-588)4003953-5 gnd |
| topic_facet | Mathematics Computer science Computer science / Mathematics Combinatorics Computational Mathematics and Numerical Analysis Robotics and Automation Mathematical Logic and Formal Languages Informatik Mathematik Endlicher Automat Sequenzielle Logik Automatentheorie |
| url | https://doi.org/10.1007/978-1-4613-8853-1 |
| work_keys_str_mv | AT buchijuliusrichard finiteautomatatheiralgebrasandgrammarstowardsatheoryofformalexpressions AT siefkesdirk finiteautomatatheiralgebrasandgrammarstowardsatheoryofformalexpressions |