Virtual Finite Automaton

Example languages recognised by finite automata

1. The language of all words containing zero or more a symbols [Finite automaton]

2. The language of all words containing zero or more a symbols, where each word has an odd (i.e. not even) length [Finite automaton]

3. The language of all words over the alphabet {0, 1} that begin with the symbol 1 [Finite automaton]

4. The language of all words over the alphabet {a, b} that do not begin with the symbol b [Finite automaton]

5. The language of all words over the alphabet {a, b} that ends with the symbol a [Finite automaton]

6. The language of all words over the alphabet {a, b} that each contain some a symbols followed by some b symbols [Finite automaton]

7. The language of all words over the alphabet {a, b, c} that each contain some a symbols followed by some b symbols followed by some c symbols [Finite automaton]

8. The language of all words over the alphabet {a, b} that each contain the substring 'aab' [Finite automaton]

Also available is a page containing the virtual finite automaton interface only.