1.

Context free language can be recognized by

A. finite state automation
B. linear bounded automation
C. push down automata
D. both b and c
Answer» E.


Discussion

No Comment Found