NFA to DFA | RGPV TOC
RGPV 2009 Q. Construct minimized DFA for the given NFA. Or Convert the following NFA into DFA. Ans. Transition table for given NFA State Input … Read more
RGPV TOC PYQ
Moore to Mealy | RGPV TOC PYQ
RGPV 2009Construct a Mealy mcahine which is equivalent to the Moore mchine given below. Present State Next State Output a = 0 a = 1 … Read more
DFA accept even 0 and even 1 |RGPV TOC PYQ
RGPV 2011Design FA which accepts even no. of 0’s and even no. of 1’s.Or RGPV 2010Construct DFA ove input alphabet Σ = {0,1} to accept string … Read more
Short note on automata | RGPV TOC PYQ
RGPV 2010Q. Write short note on automata ? Ans. An automaton is an abstract model of a digital computer. Some types of automata : Finite-state … Read more
DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
RGPV 2015Q. Design DFA accepting the following languages over the alphabet {0, 1} The set of all words ending in 00. The set of all … Read more
DFA ending with 101 | RGPV TOC PYQ
RGPV 2006Q. Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101. Ans. Some example strings … Read more
Construct DFA for a power n, n>=0 || RGPV TOC
RGPV 2009Q. Construct DFA for anb | n>=0. Ans. Some example strings = {ab, aab, aaab, aaaab} Minimum number of states required = 2.
Construct FA divisible by 3 | RGPV TOC PYQ
RGPV 2010Construct a finite automta that will accept those strings of a binary number that are divisible ny three.or RGPV 2009construct DFA for binary integer … Read more
Construct DFA equivalent to NFA | RGPV TOC PYQ
RGPV 2014Q. Construct DFA equivalent to the NFAM = ({p, q, r, s}, {0, 1}, δ, p, {q, s})Where δ is defined in the following table. δ … Read more
RGPV TOC design finite automata problems
RGPV 2008Prob 01: Designa FA which accepts set of strings containing four 1’s in every string over alphabet ∑ = {0, 1}. Ans. Some example strings … Read more