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:D
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)