s ---> sa | a
s ---> abX , X --> cY, Y --> a | axY
s ---> a sb | ab
none of these
cannot remember arbitrary large amount of information
sometimes fails to recognize grammars that are regular
sometimes recognizes grammars are not regular
None of these
Regular grammar to context free grammar
Non-deterministic FSA to deterministic FSA
Non-deterministic PDA to deterministic PDA
(a + b)
(a + b) (a + b)*
(a + b) (a + b)
abc
aab
abcc
abbb