finite automata - Advantages/Disadvantages of NFA over DFA and vice versa -


what relative pro's , con's of both dfa's , nfa's when compared each other?

i know dfa's easier implement nfa's , nfa's slower arrive @ accept state dfa's there other explicit, known advantages/disadvantages?

the advantage of nfa's on dfa's property, "choose right path". since cannot in algorithm "choose right path", conversion nfa dfa works, creating dfa states symbolize multiple nfa states. thus, when nfa in state , has choice go a,b or c next state in dfa {a,b,c}.

this explains advantages , disadvantages: dfa's can implemented easier since next state determined function. nfa's allow user easier express want, because nfa can choose between many path's.


Comments

Popular posts from this blog

c# - how to write client side events functions for the combobox items -

exception - Python, pyPdf OCR error: pyPdf.utils.PdfReadError: EOF marker not found -