Computer Science Fundamentals Algorithms Subjective
Mar 03, 2013

Compare NFA and PDA.

Detailed Explanation

NFA
1. The language accepted by NFA is the regular language.
2. NFA has no memory.
3. It can store only limited amount of information
4. A language/string is accepted only by reaching the final state.

PDA
1.The language accepted by PDA is Context free language.
2. PDA is essentially an NFA with a stack(memory).
3 It stores unbounded limit of information.
4. It accepts a language either by empty

 

Discussion (0)

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

Share Your Thoughts
Feedback