Consider the following phrases of english:
O the boy walked the dog
O the girl walked the dog
O the boy walked
O the girl walked
O the boy chased the dog
O the girl chased the dog
O the boy ran
O the girl ran
create a finite state automaton (fsa) that generates all and only the word sequences on this list