Figures from this paper
figure 1.1 
figure 1.2 
figure 1.3 
figure 1.4 
figure 1.5 
figure 1.6 
figure 1.7 
figure 1.8 
figure 10,3 
figure 10.1 
figure 10.11 
figure 10.12 
figure 10.13 
figure 10.14 
figure 10.2 
figure 10.4 
figure 10.5 
figure 10.6 
figure 10.7 
figure 10.8 
figure 10.9 
figure 11.1 
figure 11.10 
figure 11.11 
figure 11.2 
figure 11.4 
figure 11.5 
figure 11.6 
figure 11.7 
figure 11.8 
figure 11.9 
figure 2 
figure 2.1 
figure 2.10 
figure 2.11 
figure 2.12 
figure 2.13 
figure 2.14 
figure 2.16 
figure 2.17 
figure 2.18 
figure 2.19 
figure 2.2 
figure 2.20 
figure 2.21 
figure 2.22 
figure 2.3 
figure 2.4 
figure 2.6 
figure 2.7 
figure 2.8 
figure 2.9 
figure 3.1 
figure 3.10 
figure 3.11 
figure 3.13 
figure 3.14 
figure 3.15 
figure 3.16 
figure 3.18 
figure 3.2 
figure 3.4 
figure 3.5 
figure 3.6 
figure 3.7 
figure 3.8 
figure 3.9 
figure 4,10 
figure 4,12 
figure 4,15 
figure 4.1 
figure 4.11 
figure 4.13 
figure 4.14 
figure 4.2 
figure 4.3 
figure 4.4 
figure 4.5 
figure 4.6 
figure 4.7 
figure 4.8 
figure 4.9 
figure 5,9 
figure 5.1 
figure 5.11 
figure 5.13 
figure 5.15 
figure 5.17 
figure 5.18 
figure 5.2 
figure 5.20 
figure 5.21 
figure 5.22 
figure 5.23 
figure 5.3 
figure 5.4 
figure 5.4 
figure 5.6 
figure 5.7 
figure 5.8 
figure 6.1 
figure 6.10 
figure 6.11 
figure 6.2 
figure 6.5 
figure 6.6 
figure 6.7 
figure 6.8 
figure 6.9 
figure 7,7 
figure 7.1 
figure 7.10 
figure 7.11 
figure 7.12 
figure 7.13 
figure 7.14 
figure 7.5 
figure 7.6 
figure 7.8 
figure 7.9 
figure 8 
figure 8.10 
figure 8.11 
figure 8.13 
figure 8.15 
figure 8.17 
figure 8.18 
figure 8.19 
figure 8.2 
figure 8.20 
figure 8.21 
figure 8.22 
figure 8.3 
figure 8.4 
figure 8.5 
figure 8.6 
figure 8.7 
figure 8.8 
figure 8.9 
figure 9.1 
figure 9.10 
figure 9.11 
figure 9.12 
figure 9.13 
figure 9.14 
figure 9.15 
figure 9.16 
figure 9.2 
figure 9.3 
figure 9.4 
figure 9.5 
figure 9.6 
figure 9.7 
figure 9.8 
figure 9.9
13,855 Citations
An Introduction to Formal Languages and Automata
- Computer Science
- 1996
This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of formal languages, automata, computability, and related matters.
Regular Languages and Finite Automata
- Computer Science
- 1995
This chapter provides an introduction to the theory of regular languages and finite automata. These concepts will be used in the following chapters for describing behaviors of asynchronous circuits…
Finite automata and computational complexity
- Computer ScienceFormal Properties of Finite Automata and Applications
- 1988
The connections between automata and complexity that have been presented in this paper give evidence that some ideas and results from the restricted theory can fruitfully be adapted to investiate more general questions.
An Introduction to Finite Automata and their Connection to Logic
- Computer ScienceModern Applications of Automata Theory
- 2012
An introduction to the syntactic monoid, and as an application give a proof of the equivalence of first-order definability and aperiodicity of finite automata and monadic second-order logic.
Descriptional Complexity of Finite Automata: Concepts and Open Problems
- Computer ScienceJ. Autom. Lang. Comb.
- 2002
It is argued that if one wishes a renaissance of automata theory, then one should prefer to return to the investigation of the fundamental, classical problems of Automata theory rather then searching for new applications and defining numerous questionable modifications of basic models.
Computable Analysis: An Introduction
- EducationTexts in Theoretical Computer Science. An EATCS Series
- 2000
This book provides a solid fundament for studying various aspects of computability and complexity in analysis and is written in a style suitable for graduate-level and senior students in computer science and mathematics.
An Automata Approach to Some Problems on Context-Free Grammars
- Computer ScienceFoundations of Computer Science: Potential - Theory - Cognition
- 1997
In Chapter 4 of [2], Book and Otto solve a number of word problems for monadic string-rewriting systems using an elegant automata-based technique using a uniform solution to several elementary problems on context-free languages.
Theoretical Computer Science
- Computer Science
- 2008
This chapter provides a self-contained introduction to a collection of topics in computer science that focusses on the abstract, logical, and mathematical aspects of computing. First, mathematical…
Introducing finite automata in the first course
- Computer ScienceSIGCSE '88
- 1988
Students can benefit from an earlier, informal exposure to finite automata for three reasons: - Finite automata represent a useful application when two-dimensional arrays are introduced, and a painless early introduction can ease the transition to rigorous approaches encountered later.
Finite Automata Models
- Computer ScienceCommunications and Control Engineering
- 2019
This chapter provides an introduction to the theory of finite automata, including deterministic and nondeterministic models, and establishes the notation used when developing state estimation and event inference algorithms in the remainder of the book.
References
Representation of Events in Nerve Nets and Finite Automata
- Computer Science
- 1951
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.