Minimal DFA with language

39 Views Asked by At

I have a doubt about this task, have I done it correctly?

The task is: Construct a minimal DFA that accepts the following language: enter image description here

1

There are 1 best solutions below

0
On

Setting $A = \{a, b\}$, your language is $aA^*a \cup bA^*b$. Its minimal automaton has five states:

$\hskip 40pt$enter image description here