Considerando-se a definição de autômatos finitos, assinale a única alternativa que contém somente o caminho finito da figura.
A diagram of a finite automaton with three states labeled q0, q1, and q2. The automaton starts at state q0 and can transition to state q1 upon reading 'A'. From state q1, it can transition back to q0 upon reading 'A' or move to state q2 upon reading 'B'. From state q2, it can transition back to q1 upon reading 'B' or stay in q2 upon reading 'A'.
A) AB, ABAB, ABAABA
B) AB, ABAB, ABBAAB
C) AB, ABAB, ABABAB
D) AB, ABAA, ABABAB
E) AB, ABBA, ABABAB
E) AB, ABAB, ABABAB
E) AB, ABAA, ABBABA
E) AB, ABBA, ABBABA
E) AB, ABBA, ABBBAB