Which is the transition function in automata theory?

Q is a finite set of states. ∑ is a finite set of symbols called the alphabets. δ is the transition function where δ: Q × ∑ → 2 Q (Here the power set of Q (2 Q) has been taken because in case of NDFA, from a state, transition can occur to any combination of Q states)
For More Information Please Refer:


You May Also Like to Read: