RGPV Define Mealy and Moore Machine
RGPV 2010Q. Formally define the following (with example)- Mealy machine Moore machine 1. Mealy machine: Mealy machine is a six tuple machine. M = (Q, … Read more
RGPV 2010Q. Formally define the following (with example)- Mealy machine Moore machine 1. Mealy machine: Mealy machine is a six tuple machine. M = (Q, … Read more
RGPV 2010, 02Q. Write short note on equivalent of DFA and NDFA ? Ans. Every DFA is an NDFA. If from a regular set an … Read more
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 … Read more
RGPV 2015,14,02,03Q. What do you understand by DFA (Deterministic Finite Automata) and how is it represented ? Ans. A DFA means Deterministic finite automata or … Read more
RGPV 2010Q. Write short note on automaton? Ans. An automaton is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. There are … Read more
RGPV 2015 PYQQ. State and explain the properties of transition functions ? Ans. A transition function is defined on every state for every input symbol. Transition … Read more
RGPV PYQ 2010 Q. What is trap state in FA ? Ans. If a transition leads to a state from which it can never escape. such … Read more