Contex-free Grammar (CFG) can be recognized by
PYQ UGC NET 2009
Contex-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)
Attempted by 33 students.
Sign up free to check your answer
Sign up freeLoading lesson…

