## 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 which contains no. of 0 is even and no. of 1 is even.Or RGPV 2008Construct DFA accepting set of all strings containing even no. of a’s and even no. of […]

## 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 words except ε. The set of all words that begin with 0. Ans.  1. The set of all words ending with 00: Some example strings = {00, 100, 000, 1000,0100,11100} Regular […]

## 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 = {101, 10101, 01101, 00101, 111o1, 1101} Regular expression = (0+1)*101 Minimum number of states required = 4

## 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 divisible by 3 Ans. Some example strings = {0, 11, 110, 1001, 1100} Minimum number of states required = 4