PDC4S:\Coding\GATE 2021 RavindraBabu Ravula\Theory of Computation | ||
 Up one directory... | ||
 | ||
 9.Testing whether a language is regular | ||
| 8.Regular Expressions and Conversions | ||
| 7.Families of Formal Languages | ||
| 6.Epsilon NFA | ||
| 5.Moore and Mealy | ||
| 4.Minimisation of DFA | ||
| 3.NFA | ||
| 20.Practice Questions | ||
| 2.DFA | ||
| 19.Gate questions on TM and undecidability | ||
| 18.Decidable problems on Regular Languages | ||
| 17.Properties of Regular Languages | ||
| 16.Properties of CFLs | ||
| 15.Computability and decidability | ||
| 14.Countability | ||
| 13.Turing machines | ||
| 12.testing whether language is context free language | ||
| 11.PDA | ||
| 10.Grammars | ||
| 1.Instruction Note | ||