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
Parsing Beyond Context-Free Grammars
TL;DR: This book provides an extensive overview of the formal language landscape between CFG and PTIME, moving from Tree Adjoining Grammars to Multiple Context-Free grammars and then to Range Concatenation Grammar while explaining available parsing techniques for these formalisms.
Journal ArticleDOI
A lower bound technique for the size of nondeterministic finite automata
Ian Glaister,Jeffrey Shallit +1 more
TL;DR: A simple theorem is proved that provides a lower bound on the size of nondeterministic finite automata which accept a given regular language.
Journal ArticleDOI
Fuzzy relation equations (I): the general and specialized solving algorithms
Li Chen,Paul P. Wang +1 more
TL;DR: It is shown that a polynomial time algorithm to find all minimal solutions for a general system of fuzzy relation equations simply does not exist with expectation of P=NP, so the problem of solving fuzzy relation equation is an NP-hard problem in terms of computational complexity.
Journal ArticleDOI
Efficient pairwise RNA structure prediction and alignment using sequence alignment constraints
TL;DR: Pairwise RNA structural alignment improves on structure prediction accuracy relative to single sequence folding and is a straightforward method of reducing the runtime and memory requirements of the Sankoff algorithm.
Journal Article
One-level phonology: autosegmental representations and rules as finite automata
Steven Bird,T. Mark Ellison +1 more
TL;DR: A finite-state model of phonology in which automata are the descriptions and tapes (or strings) are the objects being described provides the formal semantics for an autosegmental phonology without structure-changing rules.
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.