PPT Slide

Theorem 1.3.1: every DFA-recognizable language is regular. Hence by Theorems 1.2.4 and 1.2.1 each

NFA-recognizable and _-NFA-recognizablelanguage is also regular.

Theorem 1.3.2: each regular language is _-NFA-recognizable (and a single accepting state issufficient). Hence by Theorems 1.2.4 and 1.2.1 each

regular language is also NFA-recognizable andDFA-recognizable.

Previous slide

Next slide

Back to first slide

View graphic version