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
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
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
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
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
RGPV 2018Define database management systems (DBMS). What are the major components of this system ? Explain each component. Ans. A DBMS is used for storing, … Read more
RGPV 2019Q. Explain the concepts of Primary key, Foreign key and Integrity constraints ? Ans. If there is relation between table than it must have … Read more
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
RGPV 2009Q. Construct DFA for anb | n>=0. Ans. Some example strings = {ab, aab, aaab, aaaab} Minimum number of states required = 2.
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
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