A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. 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:both b and c
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: