Virtual Finite Automaton

Consider the language of all words over the alphabet {a, b} that do not begin with the symbol b (i.e. where each word begins with symbol a, or the word has no symbols at all).

This language can also be written as {w : w {a, b}*, w does not begin with b}. For example, the following words are in the language: a, ab, aaaaaaa, abbbbbb.
The following words are not in the language: ba, aba, bbbba.

The finite automaton below will output "#ACCEPT" if it gets a word in the language and will output "#REJECT" if it gets a valid input that is not in the language.

Valid inputs to the finite automaton are words containing a symbols and b symbols, in any order, but no other symbols. Spaces are ignored.

• The input word:
  
• Start state:
  
• Accept states (comma separated):
  
• Transitions:
  99, a, 98 99, b, 00 98, a, 98 98, b, 98 00, a, 00 00, b, 00
• With some WWW browsers (e.g. Firefox) as an alternative to pressing the Run button you can just press ENTER/RETURN on your keyboard after typing the input word.