Let the Non-Deterministic Finite Automata be. Non-deterministic finite automata are represented with the help of the state diagram. Non-deterministic Finite Automata is represented as the set of 5 –tuple where(Q ,∑,δ,qo , F) It is also called Non-Deterministic Finite Automata, as it has a finite number of states. The automata where the output state for the given input cannot be determined is called Non-Deterministic Automata. The state with double circles is the final state.The empty single incoming arc represents the initial state.Transitions are represented by the arc labeled with an input alphabet.
The states are represented by vertices.State Diagram of Deterministic Finite State Automata For example, for the set Σ = and the transition function be Graphical Representation Tabular Form Kleen Star: It is the unary operator on the set of symbols Σ, which gives the infinite set of all the possible strings, including λ, of all the possible lengths over the set Σ.
