Scribd
Upload
32 views5 pages

22it832 Flat Module Bank-1

i would like to know the answerss

Uploaded by

v31857694
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views5 pages

22it832 Flat Module Bank-1

i would like to know the answerss

Uploaded by

v31857694
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

DEPARTMENT OF INFORMATION TECHNOLOGY

AND
COMPUTER APPLICATIONS

22IT832- FORMAL LANGUAGES AND AUTOMATA THEORY


III-B Tech –I SEMESTER
MODULE-1 QUESTION BANK

PART-A
1. A Company has to assign employee IDs its workers. The employees in managerial cadre will be
assigned IDs starting with “MA” while the other workers will be assigned with IDs starting with
“WR”. The remaining part of their IDs should contain even number if a’s and b’s create a DFA
and verify.
(a). Write a Language for the above scenario.
(b).Construct DFA for the above scenario and give formal description.
(c). Minimize the DFA using minimization algorithm

2. A lock for a bank contains numbers 1 through 9 in it’s door. It opens with the current combination that
follows:
a) Six keys to be pressed in sequence.
b) Every even numbered press should be a prime number (excluding 1)
c) Third press should be multiple of three
d) Fifth press should not be a multiple of 4 and 8
e) The first press could be any number that do not fall under any of the previous constraint.
Design finite automata for deciding whether to open or not to open the lock.
3. (a).Construct DFA for ”Due to stay at home, several online trainings are conducted. A company ‘X’
advertises for a one hour session on “Industry 4.0””.
(b).Design a DFA to accept the following language. L = {w: |w| mod 3 = 0} on Σ = {a}
(c) Design DFA accepting language whose binary interpretation is divisible by 5 over the alphabet {0, 1}.
(d). Design DFA accepting the set of all strings that begin with 01 and end with 11.

4.(a). Design NFA that accepts the language of strings over Σ ={0,1} such that some two 0’s
are separated by a string whose length is 4i, for some i ≥0.
(b). Design a NFA to accept strings of 0’s & 1’s such that each string ends with 00.

(c). For the NFA given below;

i. Check whether the string axxaxxa is accepted or not


ii. Give atleast two transition paths

(d).Let L be set accepted by NFA then there exists a DFA that accepts same language.

5.(a). Construct DFA Equivalent to the Following NFA

Input/state 0 1
q0 {q0,q1} q0
q1 q2 q1
q2 q3 q3
Ø q2
(b). Construct DFA equivalent to the NFA M=({q0,q1},{0,1}, δ,q0,{q1}) where δ(q0,0) = {q0,q1}
δ(q0,1) = {q1} δ(q1,0) = Ø δ(q1,1) = {q0,q1}.
(c). Construct DFA Equivalent to the Following NFA.
6.(a). Consider the following finite automaton with €-moves Obtain equivalent automaton without -€-
moves.

(b). Construct a NFA without ∈ for the following NFA with ∈.

(c). State Arden’s Theorem.


7.(a). Write the regular expression for all strings ending in 1101 over the alphabet {0, 1}.
(b). Construct regular expression for the following DFA.

(c). Construct regular expression for the given DFA.

8.(a). Construct Finite automata for the regular expression 1(01+10)*00.


(b). Construct finite automation to accept the regular expression (0+1)* (00+11)(0+ 1)*.
(c). Design a ε-NFA for the regular expression a*bc | ab* |c*.
(d). Construct NFA with ε-moves for the regular expression 10+(0+11)0*1
9.

a) Write a regular expression for L1.


b) Design a DFA for L1.
(c). Assume the password policy for creating the student in http://abc.com is set as follows.

i) Password should start with any one of the alphanumeric characters that includes # ,^ , ! , $, :
ii) Password should contain at least one upper case or at least one digits as substring.
iii) Password can contain zero or more number of lower case letters.
Derive the regular expression that generate the passwords based on the policy rules mentioned above and
design finite automaton that accepts the strings generated by regular expression.

10.(a). Prove that the given languages are regular or not by using pumping lemma.

(b). Prove that the above languages are regular or not by using pumping lemma.

(c). Consider the Mealy Machin.Construct an equivalent Moore Machin.


(d).

You might also like