Context-free grammar (CFG) can be recognized by
A. finite state automata
B. 2 way linear bounded automata
C. push down automata
D. both b and c
Answer:B
Context-free grammar (CFG) can be recognized by
A. finite state automata B. 2 way linear bounded automata C. push down automata D. both b and c