I have a doubt about this task, have I done it correctly?
The task is: Construct a minimal DFA that accepts the following language:
Setting $A = \{a, b\}$, your language is $aA^*a \cup bA^*b$. Its minimal automaton has five states:
$\hskip 40pt$
Copyright © 2021 JogjaFile Inc.
Setting $A = \{a, b\}$, your language is $aA^*a \cup bA^*b$. Its minimal automaton has five states:
$\hskip 40pt$