Re: Suffix language

pgn@xxxxxxxxx writes:

Another question.
Can anybody show me how to proof somethin like this.
Suffix of word A is any end part of word A (i.e. A=abbb, so suffixes
are: empty, b, bb, bbb, abbb).
So if L is regular language then suffix-language is also regular.
I know how to do it for preffixes.

It's pretty much the same for suffixes but in reverse, assuming the
way you do it for prefixes is the same that I have in mind.

It's not important for this construction that the automaton be
deterministic. Just think of a path from a start state to a final
state. If you have to insist on a single start state, use empty
transitions as usual.
.