Thoery of computation deals with how the problems are solved using algorithms.

DFA (Deteminstic Finite Automata)

1.For Every symbol of the alphabet, there is only one state transition in DFA.

2.DFA cannot use Empty String transition.

3.DFA will reject the string if it end at other than accepting state.

NFA(Non Deteminstic Finite Automata)

1.We do not need to specify how does the NFA react according to some symbol.

2.NFA can use Empty String transition.

3.If all of the branches of NFA dies or rejects the string, we can say that NFA reject the string.

Write your response...

Never miss a post from** Akshita**, when you sign up for Ednsquare.