1 Answers
Option 4 : Only I, II and III are undecidable
Membership algorithm does not exist for unrestricted grammars.
Regularity problem for TM is undecidable.
Equivalence of Two grammar is undecidable.
Every NFA is a PDA with a finite memory.
4 views
Answered