CODEWITHSUNDEEP
computer-sciencefinite-automatadfacomputation-theoryautomata-theory
user1697973
user1697973

Reputation:

DFA for this language

Σ={ a, b, c, d } L={ x ∈ Σ* | x does not start or end with "bab" }

Examples that should be accepted:

Examples that should be rejected:

I tried several times, and got this so far:my try

the main problem with my dfa is that it accepts "bbab"

Thank you.

Upvotes: 3

Views: 260

Answers (1)

tripleee
tripleee

Reputation: 189799

Here's what I could quickly come up with.

Slightly less gritty drawing

Upvotes: 1

Related Questions