Back to Questions

Computer Science Fundamentals Algorithms Objective

Feb 12, 2013

A CFG (context-free grammar) can be recognized by

Choose the correct answer:

A) finite state automation

B) 2-way linear bounded automata

C) push down automata

D) both b & c

Detailed Explanation

Option d is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback