DFA Solved Examples | How to Construct DFA | Online Smart Trainer

Example 1:Construct a DFA, that accepts set of all strings over ∑={a,b} of length 2 i.e. |w|=2

Example 2:Construct a DFA, that accepts set of all strings over ∑={a,b} of length at least 2 i.e. |w|>=2

Example 3: Construct a DFA, that accepts set of all strings over ∑={a,b} of length at most 2 i.e. |w|<=2

Example 4: Construct a DFA, that accepts  string 'ab' over ∑={a,b} 

Example 5: Construct a DFA,accepting all strings ending with 'ab' over ∑={a,b} 

Example 6: Design DFA which checks whether a given binary number is divisible by 3

Example 7: Design DFA to accepts L , where L  is set of strings in which 'a' always appears trippled over ∑={a,b}

Example 8: Construct minimal DFA over ∑={a,b} which checks whether given

                     a) Binary number is even

                     b) Binary number is odd

Example 9: Construct minimal DFA which accepts set of all strings over ∑={a,b}  in which every ‘a’ should never be followed by ‘bb’’.

Example 10: Construct minimal DFA over ∑={a,b} which accepts L={aⁿ bⁿ |n, m>=1}

Example 11: Construct minimal DFA over ∑={a,b} which accepts L={aⁿ bⁿ| n, m>=0}

Example 12: Construct a transition system which can accept strings over the alphabet a,b,……,z containing either cat or rat.

Example 13: Design DFA for the following languages shown below over ∑={a,b} 

          a)    L={w |w does not contains substring ab}

          b)    L={ w |w contains neither substring ab or ba}

          c)     L={ w |w is any string that does not contain exactly two a’s}

          d)    L={ w |w is any string except a & b}

Example 14: Consider below transition and verify whether the following strings will be accepted or not. Explain

          a. 010101

          b. 0011

          c. 111100

z