Computer Science Fundamentals
Algorithms
Subjective
Mar 03, 2013
Is it true the language accepted by NFA is different from the regular language? Justify. Your answer.
Detailed Explanation
No, it is false. For every regular expression r there exists a NFA with ε-transition that accepts L(r).
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts