JISCE / UG / CSE / R18 / EVEN / SEM-4 / CS403 / 2022-23 JISCE / UG / CSE / R18 / EVEN / SEM-4 / CS403 / 2022-23
10. (a) Convert the following NFA with ε-move in to an 10 3 FORMAL LANGUAGE AND AUTOMATA THEORY
equivalent DFA.
CS403
TIME ALLOTTED: 3 HOURS FULL MARKS: 70
The figures in the margin indicate full marks.
(b) Construct a regular grammar for the following REs: 5 2 Candidates are required to give their answers in their own words as far as practicable
(i) a*(a + b)b* GROUP – A
(ii) ab(a + b)* (Multiple Choice Type Questions)
11. (a) What do you mean by dead state in FSM? Give example. 7 1 1. Answer any ten from the following, choosing the correct alternative of each question: 10×1=10
(b) Explain Finite state machine. 8 1 Marks CO No.
(i) Which is true for the Mealy machine? 1 3
(a) Output depends on the present state
(b) Output depends on the present input
(c) Output depends on the present state and the present
input
(d) Output depends on the present state and the past
input
(ii) 1 1
The given DFA accepts the set of all strings over {0, 1}
that
(a) begin either with 0 or 1.
(b) end with 0
(c) end with 00.
(d) contain the substring 00.
(iii) Which two of the following four regular expressions are 1 4
equivalent?
(i) (00)*(∈ + 0)
(ii) (00)*
(iii) 0*0*
(iv) 0(00)*
Choose the following
(a) (i) and (ii)
(b) (i) and (iv)
(c) (ii) and (iii)
(d) (iii) and (iv)
(iv) Which of the following is true for the language {ap | p is 1 4
prime}?
(a) It is not accepted by a Turing machine
(b) It is regular but not context-free
(c) It is context-free but not regular
(d) It is neither regular nor context-free but accepted by
a Turing machine
Page 4 of 4 Page 1 of 4
JISCE / UG / CSE / R18 / EVEN / SEM-4 / CS403 / 2022-23 JISCE / UG / CSE / R18 / EVEN / SEM-4 / CS403 / 2022-23
(v) Given the language L = {ab, aa, baa}, which of the 1 4 (xi) Basic limitations of finite state machine is ___________. 1 2
following strings are in L*? (a) It cannot remember arbitrarily large amount of
1. abaabaaabaa information,
2. aaaabaaaa (b) In cannot remember state transitions,
3. baaaaabaaaab (c) In cannot remember grammar for a language,
4. baaaaabaa (d) It cannot remember language generated from a
(a) 1, 2, and 3 grammar.
(b) 2, 3, and 4 (xii) Which is true for Dead State? 1 1
(c) 1, 2, and 4 (a) It cannot be reached anytime
(d) 1, 3, and 4 (b) There is no necessity of the state
(vi) In Moore machine, output is produced over the change of 1 2 (c) If control enters no way to come out from the state
__________. (d) If control enters FA dead.
(a) transitions GROUP – B
(b) states (Short Answer Type Questions)
(c) all of the mentioned Answer any three from the following 3×5=15
(d) none of the mentioned Marks CO No.
(vii) Given Grammar: S->A, A->aA, A->e, B->bA 1 3
2. (a) Construct a context-free grammar for the language 3 2
Which among the following productions are Useless
L = (anb2n | n>=1 }.
productions?
(b) What is the deterministic Context Free Language? 2 2
(a) S->A
Describe with example.
(b) A->aA
3. Design a DFA for RE (0 + l)* (10l)(10 + ll)* 5 1
(c) A->e
4. (a) Define finite automata. 2 2
(d) B->bA
(b) Describe the graphical and tabular representation of finite 3 1
(viii) Given grammar G: 1 3
automata.
S->aS|A|C
5. Construct a DFA that accept all strings ending with ‘01’ 5 1
A->a
where input string belongs to (0,1).
B->aa
6. (a) Examine that the following grammar is ambiguous or not : 3 2
C->aCb
S -- >AB , A -- > ab I a , B -- > aa I a.
Find the set of variables that can produce strings only with
(b) Construct NFA that accept all strings ends with ‘10’. 2 2
the set of terminals.
(a) {C} GROUP – C
(Long Answer Type Questions)
(b) {A,B}
(c) {A,B,S} Answer any three from the following 3×15=45
(d) None of the mentioned Marks CO No.
(ix) The format: A->aB refers to which of the following? 1 3 7. (a) Design the leftmost and right most derivation of given 10 5
(a) Chomsky Normal Form production rule for input string a+a*a E→E+E/E*E/a.
(b) Greibach Normal Form (b) Explain Pumping’s Lemma for RE with proper example. 5 3
(c) Backus Naur Form
(d) None of the mentioned 8. (a) Explain Turing Machine and its tuples. 5 4
(x) The closure property of context free grammar includes 1 2 (b) Design Turing Machine that can accept all even 10 4
________. palindromes over alphabet Σ (a,b).
(a) Kleene 9. (a) Explain NFA, Epsilon NFA and DFA. 5 2
(b) Concatenation (b) Construct DFA and NFA with input (0,1) starting with 001 10 2
(c) Union
(d) All of the mentioned
Page 2 of 4 Page 3 of 4
