Popular Posts

Thursday, February 10, 2011

Difference between DFA and NFA


  • For Every symbol of the alphabet, there is only one state transition in DFA.
  • We do not need to specify how does the NFA react according to some symbol.

  • DFA can not use Empty String transition.
  • NFA can use Empty String transition.

  • DFA can be understood as one machine.
  • NFA can be understood as multiple little machines computing at the same time.

  • DFA will reject the string if it end at other than accepting state.
  • If all of the branches of NFA dies or rejects the string, we can say that NFA reject the string.

No comments:

Post a Comment

Visitor's Feedback

"I am very thankful, providing good stuff for engg students. I got good information about TOC and its information valuable for me."
: - Ankur Loriya (Ahmedabad)

"An amazing work, i just love your work!! please please please keep updating application based problems as well, it will definitely add interests to those whose visit your blog!! Thank you"
: - Preethi Velmurughan (Coimbatore)

"I got chance to learn what is the theory of computation thats why thankh you very much for this blog"
: - Ajay Sapkota (Kathmandu)

"Very nice presentation ,easy to go through the content"
: - Dr. A ramesh babu(Trichy)

"Nice tutorial example of constructing dfa..... thanks"
: - Manoj kumar (Delhi)

"I am a lecturer who is handling TOC for B.E students ....This is blog is very much useful for me ..It gives a lot of informations."
: - Sivaranjani.s (Theni)

"This is very good material for theory of computation thank you sir"
: - Mohan lal jat (Udaipur)

"its very good for engg student to get a readymade questions at the exam time. thank you."
: - Asfiya Peerjade (Kolhapur)

"I am a lecturer....this blog is awussom for me to understand.... and to learn more practical example....thanx nd plzzzz update more 1"
: - Sumedha Bhagat (Lecturer, Pune)

"You are doing very good job for an engg student for getting more problems with solution."
: - Chandrakant (Student, Nanded)