DFA (Deterministic finite automata)
In the following diagram, we can see that from state q0 for input a, there is only one path which is going to q1. Similarly, from q0, there is only one path for input b going to q2. Formal Definition of DFAA DFA is a collection of 5tuples same as we described in the definition of FA. Transition function can be defined as: Graphical Representation of DFAA DFA can be represented by digraphs called state diagram. In which:
Example 1:Solution: Transition Diagram: Transition Table:
Example 2:DFA with ∑ = {0, 1} accepts all starting with 0. Solution: Explanation:
Example 3:DFA with ∑ = {0, 1} accepts all ending with 0. Solution: Explanation: In the above diagram, we can see that on given 0 as input to DFA in state q0, the DFA changes state to q1. It can accept any string which ends with 0 like 00, 10, 110, 100....etc. It can't accept any string which ends with 1, because it will never go to the final state q1 on 1 input, so the string ending with 1, will not be accepted or will be rejected.
Next TopicExamples of DFA
