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
Regular Expressions into Finite Automata
TL;DR: Berry and Sethi have shown that the construction of an ∈-free NFA due to Glushkov is a natural representation of the regular expression, because it can be described in terms of the Brzozowski derivatives of the expression.
Journal Article
State complexity of basic operations on finite languages
TL;DR: In this paper, it was shown that the catenation of two finite languages with m > n is accepted by a DFA of (m - n + 3)2 n-2 - 1 states in the two-letter alphabet case.
Journal ArticleDOI
A connectionist theory of phenomenal experience.
Gerard O'Brien,Jonathan Opie +1 more
TL;DR: This target article develops and defends this connectionist vehicle theory of consciousness, which takes the form of the following simple empirical hypothesis: phenomenal experience consists of the explicit representation of information in neurally realized parallel distributed processing (PDP) networks.
Book ChapterDOI
The Turing machine paradigm in contemporary computing
Jan van Leeuwen,Jiří Wiedermann +1 more
TL;DR: The work of Hartmanis, Stearns, Karp, Cook and others showed that the refinement of the theory to resource-bounded computations gave the means to explain the many intuitions concerning the complexity or ‘hardness’ of algorithmic problems in a precise and rigorous framework.
Journal ArticleDOI
Supporting Self-Adaptation via Quantitative Verification and Sensitivity Analysis at Run Time
TL;DR: The main contribution is the description of a mathematical framework for run-time efficient probabilistic model checking, which statically generates a set of verification conditions that can be efficiently evaluated at run time as soon as changes occur.
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.