Tree Automata Techniques and Applications
by H. Comon, M. Dauchet, R. Gilleron
2008
Number of pages: 262
Description:
This textbook presents the basics of tree automata. The authors discuss only finite tree automata, and focus on the operational aspects of tree automata. This book should appeal the reader who wants to have a simple presentation of the basics of tree automata, and to see how some variations on the idea of tree automata have provided a nice tool for solving difficult problems.
Download or read it online for free here:
Download link
(2MB, PDF)
Similar books
Logic and Automata: History and Perspectives
by Jorg Flum (ed) - Amsterdam University Press
Mathematical logic and automata theory are two disciplines with a fundamentally close relationship. This book covers many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, etc.
(5778 views)
by Jorg Flum (ed) - Amsterdam University Press
Mathematical logic and automata theory are two disciplines with a fundamentally close relationship. This book covers many different facets of logic and automata theory, emphasizing the connections to other disciplines such as games, algorithms, etc.
(5778 views)
Automata and Rational Expressions
by Jacques Sakarovitch - arXiv.org
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.
(5870 views)
by Jacques Sakarovitch - arXiv.org
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.
(5870 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.
(914 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.
(914 views)
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
by Moshe Sipper - Springer
Employing simple parallel cellular models, coupled with evolutionary computation techniques, this volume explores the issue of constructing man-made systems that exhibit characteristics such as those manifest by their natural counterparts.
(6348 views)
by Moshe Sipper - Springer
Employing simple parallel cellular models, coupled with evolutionary computation techniques, this volume explores the issue of constructing man-made systems that exhibit characteristics such as those manifest by their natural counterparts.
(6348 views)