Lecture and Seminary on Thursday, March 15, 2018
Section outline
-
- Each regular language is accepted by an NFA
- The class of languages accepted by DFAs is closed under reversal
- Right regular grammars, left regular grammars, DFAs and NFAs are equivalent
- NFA with epsilon-transitions
- epsilon-NFAs can be converted into equivalent DFAs
- The class of languages accepted by DFAs is closed under union, product, and Kleene star
- Deterministic two-way finite-state automaton (2DFA)
-
-
The solutions to these problems are to be presented and discussed in the Seminary on March 22, 2018.
-
-