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 state complexities of some basic operations on regular languages
TL;DR: It is shown that the number of states that is sufficient and necessary in the worst case for a deterministic finite automaton (DFA) to accept the catenation of an m-state DFA language and an n-stateDFA language is exactly m2n − 2n − 1, for m, n ⩾ 1.
Journal ArticleDOI
The theory of ends, pushdown automata, and second-order logic
David E. Muller,Paul E. Schupp +1 more
TL;DR: These graphs are generalizations of Cayley graphs of context-free groups and shown to be definable in a very natural way in terms of push-down automata and to have a decidable monadic second-order theory.
Book ChapterDOI
Data Mining of User Navigation Patterns
José Borges,Mark Levene +1 more
TL;DR: A data mining model that captures the user navigation behaviour patterns as a hypertext probabilistic grammar whose higher probability strings correspond to the user's preferred trails and the use of entropy as an estimator of the grammar's statistical properties is proposed.
Journal ArticleDOI
Evolutionary stability in repeated games played by finite automata
TL;DR: In this article, the authors consider a game in which "meta-players" choose finite automata to play a repeated stage game and find that such automata must be efficient, in that they must maximize the sum of the (limit-of-the-means) payoffs from the repeated game.
Book ChapterDOI
Learning Stochastic Regular Grammars by Means of a State Merging Method
Rafael C. Carrasco,Jose Oncina +1 more
TL;DR: A new algorithm is proposed which allows for the identification of any stochastic deterministic regular language as well as the determination of the probabilities of the strings in the language.
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.