0 start So Si S2 Figure 1: Language Acceptor CS 457- HW 1 Introduction to Automata and Finite State Machines The automaton in figure 1 is a language acceptor and its response is limited to "yes" or "no", that is accept or not accept. A more general automaton, that can produce strings of symbols as output is called a transducer. An example of a transducer on the alphabet = {0, 1} is a binary adder I. In figure 1 above, write all the transition functions. 2. Given figure 1 above, write three strings (words) that are accepted by this automaton. 3. Above in figure 1, describe (in words) the language that is accepted by this automaton. 4. Draw an autornaton, for the input alphabet -{0,1}, that accepts strings of 1's and 0's but must end with at least two consecutive 0's. Make sure you show the final state