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
Fast and memory-efficient regular expression matching for deep packet inspection
TL;DR: In this article, the authors proposed regular expression rewrite techniques that can effectively reduce memory usage and developed a grouping scheme that can strategically compile a set of regular expressions into several engines, resulting in remarkable improvement of regular expression matching speed without much increase in memory usage.
Book ChapterDOI
CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes
TL;DR: Various semantics in the linear time - branching time spectrum are presented in a uniform, model-independent way, and for each of them a complete axiomatization is provided.
Journal ArticleDOI
A Maximum Entropy Model of Phonotactics and Phonotactic Learning
Bruce Hayes,Colin Wilson +1 more
TL;DR: This work proposes a theory of phonotactic grammars and a learning algorithm that constructs such Grammars from positive evidence, and applies the model in a variety of learning simulations, showing that the learnedgrammars capture the distributional generalizations of these languages and accurately predict the findings of a phonotactics experiment.
Journal ArticleDOI
Relatively Hyperbolic Groups
TL;DR: In this article, the authors propose a method to solve the problem of the problem: without abstracts, without abstractions, and without abstract sentences, without the abstracts of abstracts.
Journal ArticleDOI
Noncoding RNA gene detection using comparative sequence analysis
Elena Rivas,Sean R. Eddy +1 more
TL;DR: A comparative sequence analysis algorithm for detecting novel structural RNA genes by test the pattern of substitutions observed in a pairwise alignment of two homologous sequences to suggest that this approach detects noncoding RNA genes with a fair degree of reliability.
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.