Nondeterministic final automat - example

63 Views Asked by At

Show a possibly nondeterministic FA to accept the following language:

$$\left\{w\in\{a,b\}^*:w\text{ contains at least one instance of }aaba,bbb,\text{ or }ababa\right\}$$