Lecture 7: Decision Problems for Automata and Grammars

Om kurset

Description: Quickly reviewed last lecture. Showed the decidability of various problems about automata and grammars: \(A\)DFA, \(A\)NFA, \(E\)DFA, \(EQ\)DFA, and \(A\)CFG. Also showed that \(A\)TM is T-recognizable. Instructor: Prof. Michael Sipser