Computer Science Fundamentals
Algorithms
Subjective
Mar 03, 2013
How do you test the emptiness of regular language?
Detailed Explanation
The emptiness is defined by checking whether there is a path from the start sate to some accepting state. If there is a path available the languages non-empty. If the accepting states are separated from the start state then the language is empty.
Discussion (0)
No comments yet. Be the first to share your thoughts!
Share Your Thoughts