Automata and Rational Expressions
by Jacques Sakarovitch
Publisher: arXiv.org 2015
Number of pages: 49
Description:
From the table of contents: A new look at Kleene's theorem; Rationality and recognisability (Rational expressions); From automata to expressions; From expressions to automata; Changing the monoid; Introducing weights; Notes; References.
Download or read it online for free here:
Download link
(430KB, PDF)
Similar books
Tree Automata Techniques and Applications
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(15011 views)
by H. Comon, M. Dauchet, R. Gilleron
This textbook presents the basics of tree automata, focusing on the operational aspects. It should appeal the reader who wants a simple presentation of the basics, and to see how some variations of tree automata provide a tool for difficult problems.
(15011 views)
Notes on Automata, Logics, Games and Algebra
by K Narayan Kumar - Chennai Mathematical Institute
Contents: Regular Languages and Monoids; Languages via Logical Formulae; MSO to Regular Languages; EF Games and First-order Definability; Schutzenberger's Theorem; Alternating Automata; Buchi Automata; Buchi Games over Infinite Graphs; etc.
(9218 views)
by K Narayan Kumar - Chennai Mathematical Institute
Contents: Regular Languages and Monoids; Languages via Logical Formulae; MSO to Regular Languages; EF Games and First-order Definability; Schutzenberger's Theorem; Alternating Automata; Buchi Automata; Buchi Games over Infinite Graphs; etc.
(9218 views)
Automata Theory: An Algorithmic Approach
by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(829 views)
by Javier Esparza
These notes introduce the theory of finite- and omega-automata from an algorithmic point of view. They present automata as a data structure for sets that allows for efficient implementations of the basic set-theoretical operations.
(829 views)
Cellular Automata: Simplicity Behind Complexity
by Alejandro Salcido - InTech
Cellular automata make up a class of discrete dynamical systems, which are a core subject in the sciences of complexity due to their conceptual simplicity, easiness of implementation for computer simulation, and their amazingly complex behavior.
(10380 views)
by Alejandro Salcido - InTech
Cellular automata make up a class of discrete dynamical systems, which are a core subject in the sciences of complexity due to their conceptual simplicity, easiness of implementation for computer simulation, and their amazingly complex behavior.
(10380 views)