Open AccessBook
Introduction to Automata Theory, Languages, and Computation
TLDR
This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.Abstract:
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 some that have been solved, help readers confirm and enhance their understanding of the material. This book is appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.read more
Citations
More filters
Proceedings ArticleDOI
An event-condition-action language for XML
TL;DR: This paper defines a language for ECA rules on XML repositories, and investigates methods for analysing the behaviour of a set of E CA rules, a task which has added complexity in this XML setting compared with conventional active databases.
Book ChapterDOI
Antichains: a new algorithm for checking universality of finite automata
TL;DR: A new algorithm for checking the universality of nondeterministic finite automata, which computes the least fixed point of a monotone function on the lattice of antichains of state sets and evaluates the performance of this algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi.
Journal ArticleDOI
Regularity of splicing languages
TL;DR: A simpler proof of the fundamental fact that the closure of a regular language under iterated splicing using a finite number of splicing rules is again regular is given.
Proceedings Article
Complexity of planning with partial observability
TL;DR: It is shown that for conditional planning with partial observability the problem of testing existence of plans with success probability 1 is 2-EXP-complete, which completes the complexity picture for non-probabilistic propositional planning.
Proceedings Article
Undecidable Optimization Problems for Database Logic Programs
TL;DR: In this article, it was shown that the problem of deciding whether a given Datalog program is bounded is undecidable, even for linear programs (i.e., programs in which each rule contains at most one occurrence of a recursive predicate).
References
More filters
Book ChapterDOI
Representation of Events in Nerve Nets and Finite Automata
TL;DR: This memorandum is devoted to an elementary exposition of the problems and of results obtained on the McCulloch-Pitts nerve net during investigations in August 1951.