Scribd
Upload
15 views76 pages

Module 2

The document discusses Moore and Mealy machines, which are types of finite state machines used in computation. It outlines the structure of deterministic finite automata (DFA), nondeterministic finite automata (NFA), and their variations, along with the definitions and functions of Moore and Mealy machines. The key distinction is that Moore machines output based solely on the current state, while Mealy machines output based on both the current state and input symbol.

Uploaded by

krrish3803
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views76 pages

Module 2

The document discusses Moore and Mealy machines, which are types of finite state machines used in computation. It outlines the structure of deterministic finite automata (DFA), nondeterministic finite automata (NFA), and their variations, along with the definitions and functions of Moore and Mealy machines. The key distinction is that Moore machines output based solely on the current state, while Mealy machines output based on both the current state and input symbol.

Uploaded by

krrish3803
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 76

Theory of Computation

Module 2
Moore and Mealy Machine
Moore & Mealy Machines
• Finite Automata
• Without output (only input)
• DFA
• NFA
• NFA-ε
• With output (input and output)
• Moore Machine
• Mealy Machine
• Moore and Mealy Machines are Transducers that help in producing outputs based on
the input of the current state or previous state.
• No Final State.
tuples
• DFA
• (Q, Σ, δ, q0, F)
• Q: A finite set of states
• Σ: A finite set of input symbols, also called the alphabet
• δ: A transition function that maps the current state and input symbol to a new state
• q0: The initial state, or start state
• F: The set of accepting states, or final states

• NFA
• (Q, Σ, δ, q0, F)

• NFA-ε
• δ : Q x (∑ U ∈) → 2Q is a total function called as transition function.
Moore and Mealy Machines
• Moore Machines are finite state machines with output value and its
output depends only on the present state.
• It can be defined as (Q, ∑, Δ, δ, λ, q0) where:
• Q is a finite set of states.
• q0 is the initial state.
• ∑ is the input alphabet.
• Δ is the output alphabet.
• δ is the transition function which maps Q×∑ → Q.
• λ is the output function which maps Q → Δ.
• Mealy machines are also finite state machines with output value and t
heir output depends on the present state and current input symbol.
• λ is the output function which maps ∑ × Q → Δ
Moore Machine
Mealy Machine

You might also like