Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Finite Automata, Their Algebras and Grammars - J. Richard Büchi

Finite Automata, Their Algebras and Grammars

Towards a Theory of Formal Expressions

(Autor)

Dirk Siefkes (Herausgeber)

Buch | Softcover
316 Seiten
2012 | Softcover reprint of the original 1st ed. 1989
Springer-Verlag New York Inc.
978-1-4613-8855-5 (ISBN)
CHF 149,75 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
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.

1 Concepts and Notations in Discrete Mathematics.- 2 The Structure Theory of Transition Algebras.- 3 The Structure and Behavior of Finite Automata.- 4 Transition Systems and Regular Events.- 5 Regular Canonical Systems.- 6 General Algebras: How They Function as Tree Acceptors and Push-down Automata.- 7 General Alphabets: The Theory of Push-down Automata and Context-free Languages.- Conclusion.- List of Symbols.- References.

Zusatzinfo XXII, 316 p.
Verlagsort New York, NY
Sprache englisch
Maße 152 x 229 mm
Themenwelt Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Graphentheorie
Mathematik / Informatik Mathematik Logik / Mengenlehre
Mathematik / Informatik Mathematik Wahrscheinlichkeit / Kombinatorik
Technik Elektrotechnik / Energietechnik
ISBN-10 1-4613-8855-4 / 1461388554
ISBN-13 978-1-4613-8855-5 / 9781461388555
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
von absurd bis tödlich: Die Tücken der künstlichen Intelligenz

von Katharina Zweig

Buch | Softcover (2023)
Heyne (Verlag)
CHF 27,95
dem Menschen überlegen – wie KI uns rettet und bedroht

von Manfred Spitzer

Buch | Hardcover (2023)
Droemer (Verlag)
CHF 31,90