The above figure shows what is called a finite state machine. The machine reads one word at a time and transitions to a new state. The states are indicated by boxes and the transitions by arrows. There are three states S0, S1 and S2 and the last is the final state (indicated by two coincident boxes). The text beside each arrow means the following: DT = determiner (a, an, the), AJ = adjective, NN = noun. The machine starts at S0 and on seeing a determiner (DT) enters the state S1. Then if it sees an adjective (AJ), it remains in the same state. But at state S1 if it sees a noun (NN), it enters the final state. The final state is also called the “accept” state. No other states or state transitions are defined or permitted.
Which of the following will cause the machine to enter S2, the accept state?
