String | abc | abbbb | ac | xyz | xyxz | xyac | xyxyabbc |
---|---|---|---|---|---|---|---|

Accept or Reject? |
Accept | Reject | Accept | Reject | Accept | Accept | Accept |

All the strings accepted by the automaton constitute the language it describes. The language described by this automaton includes the strings:

- ac
- abc
- abbc
- xz
- xyxyxz
- xyxyxyxz
- xyac
- xyabc
- ..... many others

Since there is no limit to the number of characters a loop can consume, there are an infinite number of strings in this language.

Note that some finite-state automata can accept an infinite number of strings. Some strings accepted by finite automata can be infinitely long. The finite number of states does not restrict the size of the language accepted nor the length of the strings.

Does the following description correctly describe the language of this automaton?

Strings start with any number (including zero) of the pair of characters "xy". Next comes a "xz" or an "a". If "xz" then the string is done. If "a" then the string contines with any number (including zero) of "b" and ends with a single "c".