Theorem 2.3.2: L_ _* is regular if and only if __L has
Finite index.
Corollary 2.3.3: the index of regular language L
Is the smallest number of states of any DFA that
recognizes L, and each equivalence class of __L consists of exactly those input sequences having runs that reach a corresponding state of this
minimal state DFA.
| Previous slide | Next slide | Back to first slide | View graphic version |