Mooreállapotgépek

Mooreállapotgépek, also known as Moore machines, are a type of finite-state machine where the output is solely determined by the current state. This contrasts with Mealy machines, where the output depends on both the current state and the current input. In a Moore machine, each state has a defined output associated with it. When the machine transitions from one state to another due to an input, the output produced is the one designated for the *new* state.

The formal definition of a Moore machine consists of a set of states, a finite input alphabet, a finite output alphabet, a transition function that maps a state and an input to a next state, an output function that maps a state to an output, and an initial state. The transition function dictates how the machine moves between states based on the input it receives, while the output function determines what is produced at each step.

Moore machines are often used in digital circuit design and in the modeling of sequential logic. They are particularly useful for tasks where the output needs to be synchronized with the state changes, such as in control units or sequence detectors. While they can be more complex in terms of the number of states required compared to an equivalent Mealy machine, their output behavior is often considered simpler to understand and implement due to its direct dependence on the current state. The output is produced concurrently with the state, meaning it's not tied to the specific input that caused the transition.