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
Re-describing an algorithm by Hopcroft
TL;DR: A tutorial reconstruction of Hopcroft's algorithm is given focusing on a firm theoretical basis, clear correctness proofs and a well-founded computational analysis that reveals that if the size of the input alphabet m is not fixed, thenHopcroft's original algorithm does not run in time O(mnlogn) as is commonly believed in the literature.
Journal ArticleDOI
Characterizations of fuzzy finite automata
Daowen Qiu,Daowen Qiu +1 more
TL;DR: This paper establishes some important concepts in fuzzy finite automata (FFAs) with bifuzzy property, and clarify their essential relationships, and proves a number of equivalent characterizations for these concepts.
Journal ArticleDOI
Prediction, Retrodiction, and The Amount of Information Stored in the Present
TL;DR: In this paper, the authors introduce an ambidextrous view of stochastic dynamical systems, comparing their forward-time and reverse-time representations and then integrating them into a single time-symmetric representation.
Journal ArticleDOI
Bounds on the complexity of recurrent neural network implementations of finite state machines
Bill G. Horne,Don R. Hush +1 more
TL;DR: It will be shown that the node complexity for the unrestricted case can be bounded above by O (√ m ), which means that the efficiency of recurrent neural network implementations of m-state finite state machines will be explored.
Journal ArticleDOI
Distance desert automata and the star height problem
TL;DR: It is shown that it is decidable in time complexity whether the language accepted by an n-state non-deterministic automaton is of star height one, which is the first ever complexity result for the star heightOne problem.
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.