- Finite State Automaton (FSA) (a) Specify a DFA using a transition diagram and a formal FSA specifica- tion that recognizes the following language: All strings of O's and l's that contain an even number of O's and any number of l's. (b) Specify a DFA using a transition diagram and a formal FSA specifica- tion that recognizes the following language: All strings of O's and ls that, when interpreted as a binary number, its value modulo 3 = 1