Introduction to Automata Theory, Languages and Computation

  title={Introduction to Automata Theory, Languages and Computation},
  author={John E. Hopcroft and Jeffrey D. Ullman},

Figures from this paper

An Introduction to Formal Languages and Automata
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
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
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
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
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.
Complexity and Structure in Formal Language Theory
The following survey reviews some connections between formal languages and complexity theory and the concept of unambiguity, common to both areas, is treated in detail.
Computable Analysis: An Introduction
  • K. Weihrauch
  • Education
    Texts 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
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
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
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.


Representation of Events in Nerve Nets and Finite Automata
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.