Language of this finite state automaton?

64 Views Asked by At

What would be the formal definition of the language for the following Finite State Automaton?

FSA

1

There are 1 best solutions below

0
On

Your language consists of all words over $\{a,b\}$ ending in $b$ or in $ba$. You can write it as a regular expression: $$ (a+b)^*b(\epsilon + a). $$