---

＜E-Book＞
Finite Automata, Their Algebras and Grammars : Towards a Theory of Formal Expressions / by J. Richard Büchi ; edited by Dirk Siefkes

Edition	1st ed. 1989.
Publisher	(New York, NY : Springer New York : Imprint: Springer)
Year	1989
Language	English
Size	XXII, 316 p : online resource
Authors	*Büchi, J. Richard author Siefkes, Dirk editor SpringerLink (Online service)
Subjects	LCSH:Mathematics -- Data processing  All Subject Search LCSH:Control engineering LCSH:Robotics LCSH:Automation LCSH:Machine theory LCSH:Discrete mathematics FREE:Computational Mathematics and Numerical Analysis FREE:Control, Robotics, Automation FREE:Formal Languages and Automata Theory FREE:Discrete Mathematics
Notes	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 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 HTTP:URL=https://doi.org/10.1007/978-1-4613-8853-1

 Similar Items