Finite Automata, Their Algebras and Grammars 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 Buchi worked independent of other rersearch, fol...
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Frais de port :
EUR 17,94
De Royaume-Uni vers Etats-Unis
Frais de port :
EUR 2,37
Vers Etats-Unis
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 19194368-n
Quantité disponible : 5 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030034684
Quantité disponible : Plus de 20 disponibles
Vendeur : booksXpress, Bayonne, NJ, Etats-Unis
Soft Cover. Etat : new. N° de réf. du vendeur 9781461388555
Quantité disponible : 3 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N° de réf. du vendeur ria9781461388555_lsuk
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 340 pp. Englisch. N° de réf. du vendeur 9781461388555
Quantité disponible : 2 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781461388555
Quantité disponible : 10 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9781461388555
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Castle Donington, DERBY, Royaume-Uni
Etat : New. N° de réf. du vendeur 19194368-n
Quantité disponible : 5 disponible(s)
Vendeur : Books Unplugged, Amherst, NY, Etats-Unis
Etat : New. Buy with confidence! Book is in new, never-used condition 1.05. N° de réf. du vendeur bk1461388554xvz189zvxnew
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 hi. N° de réf. du vendeur 4196396
Quantité disponible : Plus de 20 disponibles