Finite state machine
A finite automata consists of following:Q: finite set of states Transition function can be define as FA is characterized into two ways:
DFADFA stands for Deterministic Finite Automata. Deterministic refers to the uniqueness of the computation. In DFA, the input character goes to one state only. DFA doesn't accept the null move that means the DFA cannot change state without any input character. DFA has five tuples {Q, ∑, q0, F, δ} Q: set of all states∑: finite set of input symbol where δ: Q x ∑ →Q q0: initial state F: final state δ: Transition function ExampleSee an example of deterministic finite automata: NDFANDFA refer to the Non Deterministic Finite Automata. It is used to transit the any number of states for a particular input. NDFA accepts the NULL move that means it can change state without reading the symbols. NDFA also has five states same as DFA. But NDFA has different transition function. Transition function of NDFA can be defined as:
δ: Q x ∑ →2^{Q}
ExampleSee an example of non deterministic finite automata:
Next TopicRegular expression
