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
Automatic Data Extraction from Lists and Tables in Web Sources
TL;DR: A suite of unsupervised learning algorithms that induce the structure of lists by exploiting the regularities both in the format of the pages and the data contained in them are developed.
Journal ArticleDOI
Complexity classes without machines: on complete languages for UP
TL;DR: Techniques for studying complexity classes that are not covered by known recursive enumerations of machines are developed by using them to examine the probabilistic class BPP and it is shown that there is a relativized world where BPPA has no complete languages.
Proceedings ArticleDOI
Reverse Engineering State Machines by Interactive Grammar Inference
TL;DR: How an existing grammar inference technique (QSM) can be used to reverse-engineer state-based models of software from execution traces at a developer-defined level of abstraction and how the QSM technique can be improved for a better balance between the number of tests it proposes and the accuracy of the machine it derives are described.
Proceedings ArticleDOI
Scenarios, goals, and state machines: a win-win partnership for model synthesis
TL;DR: In this article, the authors extend the model synthesis technique by injecting additional information into the synthesizer, when available, in order to constrain induction and prune the inductive search space.
Book ChapterDOI
Finite Automata, Digraph Connectivity, and Regular Expression Size
Hermann Gruber,Markus Holzer +1 more
TL;DR: This work develops a different, more versatile lower bound technique that is based on the star height of regular languages, which is tied to cycle rank, a structural complexity measure for digraphs proposed by Eggan and Buchi, which measures the degree of connectivity of directed graphs.
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.