Finite Automata with Output, Assignments of Computer Science

Download Finite Automata with Output and more Assignments Computer Science in PDF only on Docsity! Finite Automata with Output Mealy Machines Moore Machines • Mealy machines are also finite state machines with output value and its output depends on present state and current input symbol. • It can be defined as (Q, q0, ∑, O, δ, λ) where: 1. Q is finite set of states. 2. q0 is the initial state from where any input is processed (q0 ∈ Q). 3. ∑ is a finite set of symbols called the input alphabet. • Input alphabet called “letters”. 4. Г (△) is a finite set of symbols called the output alphabet • Output alphabet called “Characters”. 5. ‘δ’ is transition function is the input transition function • where δ: Q × Σ → Q. 6. ‘λ’ is the output function which maps Q×∑→ O. • Moore machines are finite state machines with output value and its output depends only on present state. • It can be defined as (Q, q0, ∑, O, δ, λ) where: 1. Q is finite set of states. 2. q0 is the initial state from where any input in processed (q0 ∈ Q). 3. ∑ is a finite set of symbols called the input alphabet. a. Input alphabet called “letters”. 4. Г is a finite set of symbols called the output alphabet. a. Output alphabet called “Characters”. 5. ‘δ’ is transition function which maps δ :Q× Σ → Q. 6. ‘λ’ is the output function which maps λ :Q → O. Output depends on → Present State + Current Input Output depends only on present state. Figure 1:- Mealy Machine Figure 2:- Moore Machines