Abstract
By now you have probably come across several situations in which you have observed that some automaton could be simplified either by deleting states inaccessible from the start state or by collapsing states that were equivalent in some sense. For example, if you were to apply the subset construction to the NFA
accepting the set of all strings containing the substring aba, you would obtain a DFA with 24 = 16 states. However, all except six of these states are inaccessible. Deleting them, you would obtain the DFA
From left to right, the states of this DFA correspond to the subsets {s}, {s,t}, {s,u}, {s,t,v}, {s,u,v}, {s,v}.
This is a preview of subscription content, log in via an institution to check access.
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
© 1977 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kozen, D.C. (1977). DFA State Minimization. In: Automata and Computability. Undergraduate Texts in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85706-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-85706-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-85708-9
Online ISBN: 978-3-642-85706-5
eBook Packages: Springer Book Archive