Scribd
Upload
2 views

toc

The document outlines an examination paper for the Theory of Automata, consisting of two groups of questions. Group A requires students to answer multiple-choice questions, while Group B includes various theoretical and practical questions related to automata theory, including definitions, constructions, and proofs. The exam is structured to assess knowledge on topics such as DFA, NFA, regular expressions, and Turing machines.

Uploaded by

bhaibhai59313
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

toc

The document outlines an examination paper for the Theory of Automata, consisting of two groups of questions. Group A requires students to answer multiple-choice questions, while Group B includes various theoretical and practical questions related to automata theory, including definitions, constructions, and proofs. The exam is structured to assess knowledge on topics such as DFA, NFA, regular expressions, and Turing machines.

Uploaded by

bhaibhai59313
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

507/5E(N)

March 2023

THEORY OF AUTOMATA

Time Allowed: 2.5 Hours Full Marks: 60


Answer to Question No. 1of Group Ais compulsory and to be answered first. This answer is to be made
In separate loose script(s) provided for the purpose. Maximum time allowed is 30 minutes, after which the loose
answer scripts will be collected and fresh answer scripts for answering the remaining part of the question will
be provided. On early submission of answer scripts of Question No. 1, a student will get the remaining seript
earlier.
Answer any Five (05) Questions from Group B.

GROUPA

1 Choose the correct answer from the given alternatives (any twenty): lx20

i) Cardinality of null set is


a) 0 b) I c) 2 d) none of these
ii) A DFAaccepts a
a) String b) Function c) Regular Language d) Context Free language
ii) The transition function of a NFA is
a) QX Q b) QX0 c)QXE7 d) Q XEQ"
iv) Language of finite automata is
a) Type 0 b) Type I c) Type 2 d) Type 3
Which one of the following is a unit production
a) S a b) A--B c) A’aB d) A’ [

Vi The set e, 11, 11|1, 1111|1,... .} can be represented by regular expression


a) 1* b) (11)* c) (1+1)* d) None of these

vii) In Mealy Machine output is associated with


a) Present state b) Present state and input c) Next state d) Input
viii) Context-free language can be recognized by
a) Finite Automata b) Turing Machine c) Push Down Automata d) none of
these

ix) In a grammar G = (V, £, P, S). V stands for


a) Input b) Terminal c) Start Symbol d) Variable
x) A solution to the equation R=Q + RP is
a) R=QP" b) Q
= RP c) P= RQ d) R= PO
xi) Pumping Lemma for CFL is used to show that
a) Agiven language is Regular
b) Agiven language is Context Free
c) Agiven language is Context Sensitive
d) A given language is not Context Free

117
i) Agrammar in CNF may containproductions like
a) A B b) A BC c) A a} d) A-aD

xiii) Apush down automata is different from a finite automaton hbecause of


a) arcad hcad
b)a memory in the form of stack
c)a set of states
d) all of thesc

xi) Which is more suitable for an Ambiguous grammar?


a Allambiguities can be removed
b) Ambiguity can be removed by scting priority
c) Only inherent ambiguity can be removed
d) There is no suitable rule for removing ambiguity

XV) Which of the following is not a part of 5-tuple in finite automata!?


a) Input alphabet b)Transition function C) Initial State d) Output Alphabet
Xvi) MOORE machine output depends on
a) Input b) Input and present state c) Present state d) Nonc of these
XVii) Production Rule: aAb -> agb belongs to
a) Context Free Grammar b)Context Sensitive Grammar
c) Regular Grammar d) Noneof these
XViii) Ifn is the number of states in NDFA then equivalent DFA can have maximum of
a) n states b) n-1 states c) 2'states d) 2"-1states

xix) Can a DFA simulate NFA ?


a) No b) Yes c) Some times d) Depends on DFA
XX) Given an NDFA with n states, the maximum number of states in an equivalent minimized DFA is at least
a) n' b) 2D c) n! d) None of these
Xxi) The label of the root of a parse tree is
a) V b)P c) S d) none of these

Xxii) Which of the following regular expression over 0, 1}denotes the sct of all string not containing
100 as a sub-string
a) 0'1'0) b) 0'1010 c) o'1'o1* d) o10+ 1'
Xxii) Which of the following grammars generates strings with any number of I's ?
a) b)
S1A, A’ S + 1S, S’E

C) d) (b) & (c)


S’S1, S’ ¬
Xxiv) Which one of the following is a null production
a) S’ a b) A’ t c) A+aB d) A’ B
XXV) a (a+b) is equivalent to
a a b b) ab c) (ab) d) None of these

GROUP-B
2. a) Write the formal definition of DFA.
b) Construct DFA that accept sets of all strings over 0,1| is of length 2
c)Design an NFA for alanguage that accepts all strings over(0,1} in whiclh the second last synbol is alwavs l'
2
3. a) State ARDEN'S Theorem.
bY 2-6
Construct a Regular Expression from the following DE Ausing Arden's fheroterm.
1 0, 1
1
q q3

4. a) Differentiate MEALY and MOORE machine


b Convert the Mealy machine (given below) to its equivalent Moore machine. 3-5

Present State Input Output


1

Q1 Q2 1 Q1 0
Q2 Q3 0 Q4 1
Q3 Q1 0 Q4 0
Q4 Q3 1 Q2 1

a) State the Pumping lemma for regular language.


b) Using Pumping lemma prove that the set
L={ab'|n> 1} is not regular. 3-5

6 a) With example write the form of left linear grammar and right linear grammar.
b) Show that the grammar G=((S,. (a, b.. -}.P. S)is ambiguous. Where P = S-> S-S S*S a b:.
4-4=8
7. a) Write the form of Chomsky Normal Form(CNF).
b) Convert the following CFG to CNF, P: S->ASA aB, A->BS, B->bi[ 2-6

8 a Write a short note on Turing machine.


b) Design a Turing machine to accept the language L= fa'b', n>1}. 3-5

9 a What is Epsilon NFA?


b) Construct the minimum state automata equivalent to given automata M whose transition table is given
below: 3-3

INPUT
STATE

A(Initial State) B

E(Final State) B

10. a) Define a Push Down Automata(PDA)


b) Construct a PDA accepting by empty stack for the language L= 0°1"/n>=}. 3+5 = 8

You might also like