𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic theory of automata and languages

✍ Scribed by Masami Ito


Book ID
127425479
Publisher
World Scientific Publishing Company
Year
2004
Tongue
English
Weight
1 MB
Edition
1st
Category
Library
ISBN
9812562680

No coin nor oath required. For personal study only.

✦ Synopsis


The theory of formal languages and the theory of automata were both initiated in the late 1950s, explains Ito (Kyoto Sangyo U., Japan), and the two fields have since developed into important theoretical foundations of computer science. He looks at the two from the algebraic perspective, beginning with the algebraic structure of automata, and partially ordered sets of automata as a kind of global theory. Then he delves into grammars, languages, and operations on languages. To conclude, he introduces directable automata as a special case.

✦ Subjects


Теория автоматов


📜 SIMILAR VOLUMES


Algebraic automata theory
✍ M. Holcombe 📂 Library 📅 1982 🏛 Cambridge University Press 🌐 English ⚖ 2 MB

This is a self-contained, modern treatment of the algebraic theory of machines. Dr Holcombe examines various applications of the idea of a machine in biology, biochemistry and computer science and gives also a rigorous treatment of the way in which these machines can be decomposed and simulated by s

Algebraic and Structural Automata Theory
✍ L. Beyga, T. Gajewski, Z. Miadowlcz, P. Siwak, J. Stoklosa, J. Bergandy and B. M 📂 Library 📅 1991 🏛 North-Holland Pub. Co 🌐 English ⚖ 2 MB

Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development. The result of over ten years of research, this book presents work in the following areas of Automata Theory

Introduction to automata theory, languag
✍ John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman 📂 Library 📅 2001 🏛 Addison-Wesley 🌐 English ⚖ 9 MB

This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity. The authors present the theory in a concise and straightforward manner, with an eye out for the practical applications. Exercises at the end of each chapter, including