Computer Science Fundamentals
Algorithms
Subjective
Mar 03, 2013
Regular Language:
Detailed Explanation
A Language can be described by DFA or NFA.
- Context free language cannot be described by DFA (or) NFA – since there is no memory.
- Pushdown Automata has a memory, which can be used to count the number.
- Pushdown Automata can accept context free languages. It is essentially an NFA with a stack.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts