Context free grammar is accepted byA. finite automataB. push down automataC. two way bounded automataD. both B and C

  • Interview Candidate
  • 5
  • 1989

Showing Answers 1 - 5 of 5 Answers

Amit dhamija

  • Aug 14th, 2005
 

A.finite automata

  Was this answer useful?  Yes

vijay

  • Sep 26th, 2012
 

B. push down automata

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions