Transition Table
STATES | INPUT (a) | INPUT (b) |
---|---|---|
—> A (initial state) | AB | A |
AB | ABC* (final state) | AC* (final state) |
AC* (final state) | AB | A |
ABC* (final state) | ABC* (final state) | AC* (final state) |
DFA of a string in which 2nd symbol from RHS is ‘a’
Draw deterministic finite automata (DFA) of the language containing the set of all strings over {a, b} in which 2nd symbol from RHS is ‘a’. The strings in which 2nd last symbol is “a” are:
aa, ab, aab, aaa, aabbaa, bbbab etc