Abstract
A finite automaton (FA, for short) is an online automaton whose state-set Q is finite. The finite automaton model amply illustrates the three features of computation theory described in Chapter 1. Essentially equivalent models of finite-state systems were developed over a span of three decades, to model a large range of “real-life” systems. In roughly chronological order
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag New York
About this chapter
Cite this chapter
Rosenberg, A.L. (2010). Finite Automata and Regular Languages. In: The Pillars of Computation Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-09639-1_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-09639-1_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-56117-2
Online ISBN: 978-0-387-09639-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)