Abstract
For small regular expressions, one can often see how to construct an equivalent automaton directly without going through the mechanical procedure of the previous lecture. It is therefore useful to try to simplify the expression first.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). Regular Expressions and Finite Automata. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive