The acceptor is given by the following state transition table:
| 0 | 1 | . | |
| s | a | a | r |
| a | a | a | s |
| r | r | r | r |
State s is the start state. There is one accepting state, state a. This corresponds to having received at least one 0 or 1 since the last '.' was received. State r is the state of perpetual rejection, corresponding to having received invalid input.