9:31

Design Turing Machine for the language a^nb^nc^n

12:08

convert CFG to CNF

16:37

Convert CFG to GNF

8:09

convert CFG to PDA

7:45

Kleens Theorem

5:57

Design PDA to accept the language number of a's is greater than b's

6:33

Design PDA for the language

4:24

Design PDA to accept the language a^nb^n