Scribd
Upload
15 views5 pages

Set1 2023 Automata

The document contains a question bank on formal language and automata theory for a 4th semester computer science course. It includes 15 multiple choice questions testing different concepts like the relation between DFA and NFA, definitions of NFA, DFA, transitions, languages, and applications of finite automata.

Uploaded by

T024KOUSTAV CHATTERJEE
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
15 views5 pages

Set1 2023 Automata

The document contains a question bank on formal language and automata theory for a 4th semester computer science course. It includes 15 multiple choice questions testing different concepts like the relation between DFA and NFA, definitions of NFA, DFA, transitions, languages, and applications of finite automata.

Uploaded by

T024KOUSTAV CHATTERJEE
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

ACADEMY OF TECHNOLOGY

QUESTION BANK
FORMAL LANGUAGE AND AUTOMATA THORY
4TH SEM CSE/CSBS
MODULE I

BLOOM’S TEXANOMY LEVEL: 2

SL NO QUESTIONS MARK CO
S NO
1 If S is the number of states in NDFA then equivalent DFA can have 1 1
maximum of
(a) S states (b) S - 1 state
(c) 2s states (d) 2s – 1 states

2 NFA, in its name has ’non-deterministic’ because of : 1 1


a) The result is undetermined
b) The choice of path is non-deterministic
c) The state to be transited next is non-deterministic
d) All of the mentioned

What is wrong in the given definition? 1 1


3 Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
a) The definition does not satisfy 5 Tuple definition of NFA
b) There are no transition definition
c) Initial and Final states do not belong to the Graph
d) Initial and final states can’t be same
4 1 1
What is the relation between DFA and NFA on the basis of
computational power?
a) DFA > NFA
b) NFA > DFA
c) Equal
d) Can’t be said
5 Construct a DFA that accept the Language “The set of all string not 3 1
containing the substring 010” over the alphabet Σ = {0,1};

6 Draw a transition diagram of a state automation A that accepts the given 3 11


set of strings over ( a, b).

a) even number of a s and


b) exactly one b.

7 There are ________ tuples in finite state machine. 1 1


a) 4
b) 5
c) 6
d) unlimited
8 Transition function maps. 1 1
a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q

9 Number of states require to accept string ends with 10. 1 1


a) 3
b) 2
c) 1
d) can’t be represented.
10 Extended transition function is . 1 1
a) Q * Σ* -> Q
b) Q * Σ -> Q
c) Q* * Σ* -> Σ
d) Q * Σ -> Σ
11 δ*(q,ya) is equivalent to . 1 1
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
12 String X is accepted by finite automata if . 1 1
a) δ*(q,x) E A
b) δ(q,x) E A
c) δ*(Q0,x) E A
d) δ(Q0,x) E A
13 Finite automata requires minimum _______ number of stacks. 1 1
a) 1
b) 0
c) 2
d) None of the mentioned
14 The basic limitation of finite automata is that 1 1
a) It can’t remember arbitrary large amount of information.
b) It sometimes recognize grammar that are not regular.
c) It sometimes fails to recognize regular grammar.
d) All of the mentioned
15 NFA, in its name has ’non-deterministic’ because of : 1 1
a) The result is undetermined
b) The choice of path is non-deterministic
c) The state to be transited next is non-deterministic
d) All of the mentioned
16 What is wrong in the given definition? 1 1
Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})
a) The definition does not satisfy 5 Tuple definition of NFA
b) There are no transition definition
c) Initial and Final states do not belong to the Graph
d) Initial and final states can’t be same
7 Design a FA with ∑ = {0, 1} accepts those string which 3 2
starts with 1 and ends with 0.
8 Design FA with ∑ = {0, 1} accepts even number of 0's and 3 1
even number of 1's.
9 Design FA with ∑ = {0, 1} accepts the set of all strings with 3 1
three consecutive 0's
10. Design an NFA in which all the string contain a substring 3 1
1110.
11 Convert the following NFA with ε to NFA without ε. 4 1

BLOOM’S TEXANOMY LEVEL: 3

SL NO QUESTION MA CO
RKS NO
1 Convert the given NFA to DFA. 4 1

2 Convert the Mealy Machine ( given below ) to a Moore Machine. 4 1

Present NextState i/p=o Next state i/p=1


State State Output State Output
Q1 Q2 1 Q1 0
Q2 Q3 0 Q4 1
Q3 Q1 0 Q4 0
Q4 Q3 1 Q2 1

3 Use Myhill-Nerode theorem to minimize the FA shown below: 4 1

4 Convert the given NFA to 4 1


DFA.

5 Design a DFA over ∑ ={0,1} that accepts string ends with 101. 5 1

6 Design a DFA over ∑ ={a,b} that accepts string having anbm 5 1


where n,m>0.

7 Design a DFA over ∑ ={0,1} that accepts number divisible by 3. 5 1

8 Which of the following is an application of Finite Automaton? 1 1


a) Compiler Design
b) Grammar Parsers
c) Text Search
d) All of the mentioned
9 Predict the number of transitions required to automate the following language 1 1
using only 3 states:
L = {w | w ends with 00}
a) 3
b) 2
c) 4
d) Cannot be said
10 Given Language: {x | it is divisible by 3} 1 1
The total number of final states to be assumed in order to pass the number
constituting {0, 1} is
a) 0
b) 1
c) 2
d) 3
11 There are ________ tuples in finite state machine. 1 1
a) 4
b) 5
c) 6
d) unlimited

12 Finite automata requires minimum _______ number of stacks. 1 1


a) 1
b) 0
c) 2
d) None of the mentioned
1 1
NDFA Stands for____________________________
13 a) Non Determining Finite Automata b) None Deterministic Finite Automata
c) Non Deterministic First Automata Automata
d) Non Deterministic Finite

You might also like