Question: Describe the strings accepted by the following finite automaton with a start state of a and accepting states a, b, and c.
_________
/ _ \0
__ / /1\ \ 1______
/ 0\ L 1 \ L 0 \ / v
\-->a ----> b ----> c <---- d
^ 0 /
\_____________/1
Answer: If the accepting state were d, then this would accept strings ending in 101. Since the accepting states are all those but d, this accepts strings that do not end with the string 101.