Scribd
Upload
16 views2 pages

Module 1 & 2 University Questions

Uploaded by

shreyy180605
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
16 views2 pages

Module 1 & 2 University Questions

Uploaded by

shreyy180605
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/ 2

Theoretical Computer Science (TCS) TE-COMPS-V

---------------------------------------------------------------------------------------------------------
Module 1 Questions

1. Differentiate between NFA and DFA. (Nov 22 5M)


2. Compare and contrast Moore and Mealy machine. (Nov 22 5M)
3. Design mealy machine to recognize 𝑟 = (0 + 1)∗ (00 + 11) and then convert it to Moore
machine. (Nov 22 10M)
4. Application for finite autometa. (May 23 5M)
5. Construct a Moore machine to convert all occurrences of 100 to 101 in a string over {0,1}.
Convert it into mealy machine. (May 23 10M)
6. Different applications of FA. .(Nov 23 5M)
7. Design DFA that accepts strings with atleast 3 a’s over ∑ = {𝑎, 𝑏} . (Nov 23 5M)
8. Compare and contrast Moore and mealy machine. Design Moore machine for ∑ = {0,1}
print residue modulo 3 for binary no. (Nov 23 10M)
9. Design DFA that accept string which ends with either 110 or 101 ∑ = {0,1} .(Nov 23 5M)
10. Design NFA that accepts string starts with “abb” or “bba”. (Nov 23 5M)
11. Given NFA with Epsilon find equivalent DFA. q1 is initial state, q3 is final state. (Nov 23 10M)
0 1 2 ∈
->q1 { q1} - - { q2}
q2 - { q2} - { q3}
q3* - - { q3} -

12. Discuss difference in transition function of FA, PDA and TM. (June 24 5M)
13. Design DFA that accepts strings that contain “ba” or “ab” ∑ = {𝑎, 𝑏} . (June 24 5M)
14. Design DFA that accepts strings that are muitiple of 4 ∑ = {0,1}. (June 24 5M)
15. Design NFA that accepts strings starting with a and ending with a or starting with b or ending
in b. (June 24 5M)
16. Design mealy machine to change every occurrence of a with x, b with y and c is kept
unchanged. Convert same to Moore machine. (June 24 10M)
17. Short note : Arden’s theorem. (June 24 5M)
Module 2 Questions

1. Represent RE ∈ for L= w/w has prefix ‘bab’ and suffix ‘abb’ and w is a string over ∑ = {𝑎, 𝑏} .
Design NFA with epsilon moves for accepting L. Convert to minimize DFA. (June 24 10M)
2. Explain pumping lemma for regular language. Prove that given L is not regular 𝐿 =
{𝑎𝑛 𝑏𝑛+1 /𝑛 ≥ 1} . (June 24 10M)
3. Explain pumping lemma with the help of a diagram to prove that given language is not a
regular 𝐿 = {0𝑚 1𝑚+1 /𝑚 > 0} .(Nov 23 10M)
4. Convert following RE to NFA-∈ and convert it to minimized DFA corresponding to it
(0 + 11)∗ (10)(11 + 0)∗ .(May 23 10M)
5. Give formal definition of pumping lemma for Regular Language . Prove that the following
language is not regular.𝐿 = (𝑤𝑟𝑤 𝑟 / 𝑤 ∈ {𝑎, 𝑏}∗ , 𝑟 ∈ {𝑐}, |𝑤| ≥ 1} .(May 23 10M)
6. Decision properties of regular language. (Short note) (May 23 5M)
7. Convert the following RE into NFA with ∈ moves and hence obtain DFA. 𝑅𝐸 = (0+∈
)(10)∗ (∈ +1) . (Nov 22 10M)
8. Give formal definition of pumping lemma for R.L. and P.L. 𝐿 = {0𝑚 1𝑚+1 /𝑚 > 0 .(Nov 22
10M)
9. Short note: Decision properties of Regular Language. (Nov 22 10M)

You might also like