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
Journal ArticleDOI
The Configurational Matrix
Ad Neeleman,Hans van de Koot +1 more
TL;DR: In this paper, a theory of grammatical dependencies that is in accordance with basic assumptions of bare phrase structure theory is presented, based on two primitive syntactic relations (copying and function application) and a nonatomic view of nodes.
Optimising an Arbitrary Function is Hard for the Genetic Algorithm.
William E. Hart,Richard K. Belew +1 more
TL;DR: It is concluded that theoretical and experimental analyses of the GA which do not specify the class of functions being optimized can make few claims regarding the eeciency of the genetic algorithm for an arbitrary tness function.
Proceedings ArticleDOI
A fast regular expression indexing engine
Junghoo Cho,Sridhar Rajagopalan +1 more
TL;DR: The design, architecture, and lessons learned from the implementation of a fast regular-expression indexing engine FREE show orders of magnitude performance improvement in certain cases over standard regular expression matching systems, such as lex, awk and grep.
Journal ArticleDOI
A complexity theory for feasible closure properties
TL;DR: In particular, the authors showed that subtraction is hard for the closure properties of #P, SpanP, OptP, and MidP, which is a general theory of complexity of closure properties.
Journal ArticleDOI
Computing with First-Order Logic
Serge Abiteboul,Victor Vianu +1 more
TL;DR: It is shown that fixpoint and while are the PTIME and PSPACE restrictions of GMloose, and more powerful languages which model arbitrary computation interacting with a database using a finite set of FO queries are considered.
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.