Question

Σ = { a, b, c }

Create deterministic finite automata with the language of all strings that …

1. end with 'abc'

Answer 1

Please find the solution below:

Example:

test string 'acabc'

it ends in state s3. So, it's a final state. accepted

test string 'abca'

it ends in state s0. So, it's not a final state. rejected.