RGPV 2010Q. Formally define the following (with example)- Mealy machine Moore machine 1. Mealy machine: Mealy machine is a six tuple machine. M = (Q, Σ, △, δ, λ, q0) Q is finite set of states. Σ is the input alphabet. △ is the output alphabet. δ is transition function which maps Q×∑ → Q. ‘λ’ is the output function which […]

### Category: RGPV Unit 1

## RGPV TOC Short note on equivalent of DFA and NFA

RGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans. Every DFA is an NDFA. If from a regular set an NDFA is created than there may be chances of existence of DFA. DFA is 5 tuple machine: M = (Q, Σ, δ, q0, F) Q is a finite non empty […]

## RGPV notes Write short note on NDFA

RGPV 2002Q. Write a short note on non-deterministic finite automta ? Ans. Non deterministic finite automata refere as NDFA or NFA allows a set of possible moves. For example from a state an input ‘1’ can transit 0 times, 1 times or more than 1 times. Its not determined in NFA like in DFA. NDFA […]