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
Book ChapterDOI
P Automata or Purely Communicating Accepting P Systems
TL;DR: It is shown that for any recursively enumerable language, a Pautomaton and a certain type of projection can be constructed such that the given language is obtained as the image of the set of accepted input multiset sequences of the PAutomaton.
BookDOI
Advances in cryptology--CRYPTO '89 : proceedings
TL;DR: This volume presents the proceedings of the 9th CRYPTO meeting and discusses why is cryptography harder than it looks?
Journal ArticleDOI
A uniform approach to obtain diagonal sets in complexity classes
TL;DR: A uniform method for constructing sets which diagonalize over certain complexity classes while preserving other complexity properties is given, obtaining some known results as well as some new ones as corollaries of the main theorem.
Proceedings ArticleDOI
Policy ratification
TL;DR: Algorithms from constraint, linear, and logic programming disciplines are presented to help perform ratification tasks and an algorithm is provided to efficiently assign priorities to the policies based on relative policy preferences indicated by policy administrators.
Book ChapterDOI
Grammars with controlled derivations
TL;DR: It is shown that “all” natural languages contain constructions which cannot be described by context-free grammars, and three basic such features of natural languages are: reduplication, multiple agreements, and crossed agreements.
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.