Abstract
We have studied what finite automata can do; let’s see what they cannot do. The canonical example of a nonregular set (one accepted by no finite automaton) is
, the set of all strings of the form a*b* with equally many a’s and b’s.
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
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1997). Limitations of Finite Automata. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1844-9_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-1844-9_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7309-7
Online ISBN: 978-1-4612-1844-9
eBook Packages: Springer Book Archive