Scribd
Upload
28 views6 pages

TOC - Question Bank

The document is a question bank for the K.S. School of Engineering and Management's Department of Artificial Intelligence and Data Science for the 2024-2025 academic session. It covers topics across five modules, including automata theory, regular expressions, context-free grammars, pushdown automata, and Turing machines. Each module contains various questions that require explanations, constructions, and proofs related to the respective topics.

Uploaded by

Niveditha Prakash
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
28 views6 pages

TOC - Question Bank

The document is a question bank for the K.S. School of Engineering and Management's Department of Artificial Intelligence and Data Science for the 2024-2025 academic session. It covers topics across five modules, including automata theory, regular expressions, context-free grammars, pushdown automata, and Turing machines. Each module contains various questions that require explanations, constructions, and proofs related to the respective topics.

Uploaded by

Niveditha Prakash
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/ 6

K.S.

SCHOOL OF ENGINEERING AND MANAGEMENT, BANGALORE - 560109


DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
SESSION: 2024-2025 (ODD SEMESTER)
Question Bank

Module-1

1. Explain the following with example


a) Alphabet b) String c) Symbol d) Kleen star e) empty string f) Language g)Kleen
plus h) power of an alphabet
2. Explain finite automata with block diagram.
3. Distinguish between NFA and DFA with example.
4. Define transition diagram with example.
5. Explain the application of automata theory
6. Write the notations for the language accepted by DFA, NFA, ε-NFA .
7. Construct a DFA for the following language L= {w Є (0, 1)*: w contains strings where
number of 0’s in every string is multiple of 3 }
8. Construct a DFA for the below language L={ w Є (a, b)*: every a region in w is of
even length}
9. Construct a DFA which accept all integers divisible by 4. Assume that the input strings
representing the integer binary form.
10. Construct a DFA which accepts all string in which 110 is a substring over ∑={0,1}.
11. Construct a DFA which accepts the language L={ w Є (a)*: where w mod 3 =0}
12. Construct a DFA which accepts the language L={w|w has an even number of 0’s or
even number of 1’s}
13. Construct a DFA for the language that contains strings on which leftmost symbol
differ from rightmost symbol over ∑={c,d}.
14. Construct a DFA which will accept the string having exactly one a over ∑={0,1}.
15. Design a DFA Which accepts set of strings that every string containing 00 as substring
not 000 where w Є (0,1)*.
16. Construct a NFA for the language L={ w|na(w)=2 and nb(w)>=3, w Є (a,b)*}
17. Draw a NFA which accepts set of all strings containing 1100 as substring over
∑={0,1}.
18. Construct a NFA that contains all strings containing 1 in the third position from end?
19. Convert the following NFA to DFA and describe the language it accepts.
20.

21. Convert the following NFA with Ԑ- transition to NFA without Ԑ- transition.

Module-2

1. What is regular expression?


2. Write RE for the following:
(i)Language of all strings of 0’s and 1’s that have odd number of 1 .
ii) L= {w Є {0, 1}*:w has 001 as a substring}
iii) L= {w Є{a, b}*:#a(w)<=3}
iv) L contains atleast one a’s and atleast one b’s over ∑={a,b,c}
v) L={w|w Є (0, 1)* with atleast 3 consecutive 0’s:}
vi) L= {w Є {a, b}*:anbm | n>=4 and m<=3}
vii) Language that either start with 01 or end with 01 over ∑={0,1}.
viii) For strings of a’s and b’s having length 2.
ix) L contains even number of a’s and any number of b’s
x) L= {anbm| m+n is even}
xi) L= {anbm| m≥1, n≥1, mn≥3}
xii)L= {a2nb2m| m≥0, n≥0}

3. Construct an equivalent NDFSM for the following regular expressions:


i) 10+(0+11)0*1
ii) aa*b+bb*a
iii) 0+01*
iv) (a* U ab) (a U b)*
4. Build the regular expression for the below finite automata
i)

ii)
iii)

iv)

5. State and prove pumping lemma theorem for regular language.


6. List out closure properties of regular set.
7. Show that regular language are closed under complement and intersection.
8. Show that L={0n1n | n≥0} is not regular using pumping lemma.
9. Show that L={WWR : WЄ(0, 1)* } is not regular using pumping lemma
10. Prove that L={aP| p is prime } is not regular.
11.Define distinguishable and indistinguishable states. Make use of table filling method to
minimize the number of states in the below DFSMs.
a) b)

12.

Consider the above 2 Automata and identify whether both are equivalent to each other or not.
Module-3
1. Describe the CFG to accept arithmetic expression id+id*id
2. What is derivation tree. Write all its properties .Explain LMD and RMD with example.
3. Define CFG. Find out CFG for the following language.
a. L={wЄ(a,b)*| w contains at least 2 a’s}
b. L={wcwR | wЄ(a,b)*}
c. L={anb2n :n>=1}
d. Which generates palindrome for binary numbers
4. What is parse tree? Consider a CFG SXX, XXXX|bX|Xb|a. Draw the parse tree
for the string bbaaaab.
5. Consider the following grammar and derive the string aaabbabbba by using RMD
method and draw the parse tree.
SaB|bA
AaS|bAA|a
BbS|aBB|b
6. Consider the following CFG and derive the string aabbaa by using lm derivation.
S aAS|a
ASbA|SS|ba
Also draw the left parse tree.
7. Determine the language generated by each of the following productions.
a. SaA, SaS , Aab
b. SabS, SaA, Aa
c. SaSb, SԐ
8. Define Ambiguity. Consider the grammar E->E+E|E*E|(E)|id. Find the leftmost, rightmost
derivations and parse trees for the string id+id*id. And show that this grammar is
ambiguous.
9. Show that the following grammar is ambiguous by taking the string aab.
S → aS | aSbS | ϵ
10. What is PDA? Expalin the block diagram of PDA. Wtite the 7 tuple notaion for PDA.
11. Construct a PDA to accept the following language. L={anbn|n>=0}. Draw the
transition diagram for the constructed PDA. Show the ID’s for the string aaabbb.
12. Construct a PDA for the language that accept the strings with na(w)> nb(w) where
wЄ(a+b)* and show the ID of the PDA on input string abbab.
13. For the below Grammar obtain the corresponding PDA
S  aABC, A aB | a, B bA | b, C a

Module-4
1. What is Normal form? Explain CNF and GNF.
2. Express the following grammar in CNF.
S→ 0A | 1B
A→ 0AA | 1S | 1
B→ 1BB | 0S | 0
3. Convert the following grammar into GNF.
S→ AB1 | 0
A→ 00A | B
B→ 1A1
4. Solve the following CFG using ε-productions and Unit productions.
S →aA | aBB A → aAA | ε
B→ bB | bbC C →B
5. Show that “CFL is closed under Union” and “CFL is not closed under intersection”.
6. Express the following CFG in GNF.
S →abSb|aa
7. Solve the following CFG .
S →a|Xb|aYa
X →Y|Ԑ
Y →b|X
Z →d

8. Covert the following grammar to CNF:


S → ASB | ε
A → aAS | a
B → SbS | A | bb
Module-5
1. Define Turing Machine. With a neat Block diagram, explain the the working of basic
Turing Machine.

2. Explain the following.


a) Multitape Turing Machine
b) Nondeterministic Turing Machine
3. Explain Halting Problem in Turing Machine.
4. Construct a Turing machine to accept L={0n1n| n>=1}. Draw the transition diagram. Show the moves
made for string 0011.

5. Design a Turing Machine to accept strings formed on {0,1}* and ending with 000. Write
transition diagram and sequence of IDs for w = 101000
6. Design a Turing Machine to accept all set of palindrome over {a,b}*. Draw the transition table
and also transition diagram. Show the sequence of IDs for the string: “ababa”
7. Briefly explain The Techniques for Turing Machine construction. Also write applications of Turing
Machine.
8. Design a Turing machine to accept L={anbncn| n>=0}. Draw the transition diagram. Show the
moves made for string aabbcc.
9. Explain recursively enumerable language
10. Write application of turing machine.

You might also like