[4]
[10]
[6]
1) Design a Finite Atomata FA which accepts odd number of 0S and even number of 1s
2) Design a finite automata which accepts even number of 0s and odd number of 1s.
3) Design a DFA which accepts the odd number 1s and any number of 0s over = {0, 1}.
4) Design a finite automata that reads strings made up of letters in the Word
CHARIOT and recognize those strings that contain the word CAT as a substring. [8]
5) Design FA that reads strings made up of = {0,1} and accepts only those strings
which ends with 00 or by 11.
[6]
6) Design a FSM to concept those strings having 101 or 110 as substring.
[4]
7) Design a DFA for a language of strings of 0s and 1s such that [10]
i) Substring is 10. ii)Strings ending with 101.
8) Design an FSM for divisibility by 3 tester for a binary number.
[6]
9) Design a Finite State Machine for divisibility by 5 tester of a given decimal number. [8]
10) Design a FSM for divisibility tester of urinary number by 2.
[8]
11) Design an FSM for divisibility by 3 tester for a unary number.
[6]
12) Obtain a DFA to accept strings of as and bs such that L = {W/W (a + b)* such that Na(W) mod 3 = 0 and Nb(W) mod 2 = 0}
[10]
13) Construct a NFA that accept any positive number of occurrences of various strings
from the following language L given by L = { x {a, b} | x ends with aab).
[6]
14) Construct the NFA for the language of all strings that begin and end with same symbol
over the alphabet = {0, 1} .
[4]
15) Design an NFA to accept set of all strings which end with 00. Where
I = {0, 1}. Convert this NFA into its equivalent DFA.
[8]
16) Construct a NFA that accept any positive number of occurrences of various strings from
the following language L given by L ={x{a,b}x ends with aab) .
[ 6]
17) Construct a NFA and then equivalent DFA accepting strings over {0, 1}, whose every
block of 4 consecutive symbol, contain at least 3 zeroes (i.e. 0s)
[10]
18) Construct a NFA that accept the set of strings in (0+1)* such that some two 0s are
separated by string whose length is 4i, for some i>=0.
[6]
19) Design NFA which accepts the string containing either 01 or 10
[6]
RE to FA
1) Construct a DFA for the regular expression (a+b)*(baaa)
[6]
2) Describe in English language accepted by R.E. (0+1)* 0
[2]
3) Construct DFA for the following regular expression RE = (a+b)* abb. [6]
4) For each of the following regular expression, draw an Finite Automata recognizing
the corresponding language
[10]
1) (1 + 10 + 110) *0
2) 1 (01 + 10)* + 0(11+10)*
3) (010 + 00)* (10)
4) 1 (1+10)* + 10(0+01)*
5) Construct NFA for the following regular expression. (0 + (0 + 1)*)+
[6]
6) Construct a DFA with reduced states equivalent to the regular expression
10 +(0+11)0*1.
[10]
7) Construct NFA from the following regular expressions :
[8]
i) 0*1*2*
ii) (00 + )* (10)*.
8) Construct DFA for following regular expression RE = b (a + b)* a .
[6]
9) Construct DFA for following regular expression RE = (a + b) * a b b.
[6]
10) For the following regular expression, draw an FA recognizing the corresponding
language. r = (1+10)* 0
[6]
11) Design an NFA equivalent to following RE[6]
(0 + 1)*(00 + 11) (0 + 1)*
12) For each of the following regular expression, draw an Finite Automata recognizing
the corresponding language.
[10]
1) (10 + 1 + 110)*1
2) 1 (10 + 01)* + 0 (10 + 11)*
3) (010 + 100)* (10)
4) 1 (1 + 10)* + 10 (0 + 01)*
13) Construct the finite automata equivalent to the following regular set and describe in
English set denoted by following regular set
[8]
1) 10 + (0 + 11) 0* 1
2) 01 [((10)* + 111)* + 0]* 1
14) Describe in simple english the language defined by following RE:
[4]
i) (a+b)* aa (a+b)** ii) (b+ba)*
iii) a (a+b)*b
iv) a+b*c+
Language to RE
1) Find all possible regular expression ever L C {0,1}*
i) The set & all possible string containing 01.
ii) The set of all string that do not end with 01.
2) Find a RE corresponding to each of the following subsets of {0, 1}*.
[6]
1) The language of all strings containing exactly two 0s.
2) The language of all strings containing atleast two 0s.
3) The language of all strings not containing the substring 00.
3) Give RE for the following languages over ={0,1}. [6]
i) Strings containing even number of 1s followed by odd number of 0s.
ii) Strings that do not contain three consecutive 0s.
iii) Strings that contain at most three 0s.
[4]
4) Find the regular expression corresponding to each of the following subset of {0, 1}*
a) The language of all strings not containing the substring 000
b) The language of all strings that do not contain then substring 110
c) The language of all strings containing both 101 and 010 as substring. [10]
Pumping Lemma
1) State and explain Pumping Lemma for regular sets.
2) Find out whether given languages are regular or not
a) L = {ww|w{0,1}*}
b) L = {1k | k = n2 ,n > =1} .
c) L = {xy/x, y {0, 1} * and y is x}.
3) Show whether the language L = {0n 12n | n>0} is regular or not.
4) Let L = {0n | n is prime} show that L is not regular.
5) Show that the set L ={ai 2| i 1} is not regular.
[6]
[8]
[6]
[6]
[6]
2) A transition table is given for another NFA with NULL with seven state. 6
[4]
FA to DFA
1) Show stepwise process of constructing DFA equivalent to the NFA :
[6]
[6]
[6]
[8]
[8]
[6]
7) Construct an equivalent DFA fer given NFA m={q,p,r,s,t}, {0,1}, ,p, {t}
where is defined in the following table.
[10]
[6]
2) Consider the following NFA with -transitions. Convert this NFA to NFA
without -moves :
[8]
[10]
[8]
[6]
[6]
[6]
3) Convert the following automata given in fig. (i) and fig. (ii) to equivalent regular
expression.
[10]
FA to RE (Ardens theorem. )
1) Construct regular expression for following transition diagram :
[6]
[6]
[8]
4) Consider the following transition diagram and convert it to its equivalent regular
expression using Ardens theorem. Consider the transition diagram given below. Prove
that the strings recognized are : (a + a (b + a a)*b)*a (b + a a)*a.
[6]
6) Construct a regular expression corresponding to the state diagram given below : [6]
[10]
[10]
3) Convert the following Mealy machine to its equivalent Moore machine -[6]
4) Convert the following Mealy machine to Moore machine and what is the output of
this mealy machine ? [6]
[2]
[4]
[6]
Moore to Mealy
[6]