This document discusses Mealy and Moore machines, which are two types of finite state machines (FSM). It provides details on each: - Mealy machines produce outputs on transitions between states based on both the present state and input. Moore machines produce outputs based only on the present state. - Both can be described using tuples but the output functions differ - Mealy machines have an output transition function while Moore machines have an output function. - Advantages of each include Mealy machines having faster response times while Moore machines are cheaper and easier to use. Disadvantages include Mealy machines being more expensive and states becoming unmanageable. - Examples of uses include processors for Mealy machines and SRAM