I have heard that DFA can be simulated by Loop and NFA can be simulated by recursive method. I don’t understand how that works. Can anyone give me an example?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have heard that DFA can be simulated by Loop and NFA can be simulated by recursive method. I don’t understand how that works. Can anyone give me an example?
In a sense, sure. DFAs can easily be simulated by writing a
do...whileloop with aswitchstatement in it based on the current state, whereas you can think of a simulator for NFAs as doing a search on a tree (depth first search is recursive, although you could just as well imagine a breadth-first search). There’s not really any formality in this, just a casual observation about how you might implement simulators.