1. The document discusses finite automata with output, including Moore machines. 2. A Moore machine consists of states, input/output alphabets, transition and output tables. The transition table specifies the next state for each input, while the output table gives the output for each state. 3. An example Moore machine is given with 4 states that maps the input string "abbabbba" to the output string "100010101".