Automata Theory

Chapter
Part of the Undergraduate Topics in Computer Science book series (UTICS)

Abstract

Automata theory is the branch of computer science that is concerned with the study of abstract machines and automata. These include finite-state machines, pushdown automata and Turing machines. Finite-state machines are abstract machines that may be in one state at a time (current state), and the input symbol causes a transition from the current state to the next state. Pushdown automata have greater computational power, and they contain extra memory in the form of a stack from which symbols may be pushed or popped. The Turing machine is the most powerful model for computation, and this theoretical machine is equivalent to an actual computer in the sense that it can compute exactly the same set of functions.

References

  1. 1.
    G. O’Regan, Guide to Discrete Mathematics (Springer, Switzerland, 2016)Google Scholar
  2. 2.
    J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Boston (1979)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.SQC ConsultingMallow, County CorkIreland

Personalised recommendations