Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
691 views

TOC Module 2 Complete Solutions

Uploaded by

Krittika Hegde
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
691 views

TOC Module 2 Complete Solutions

Uploaded by

Krittika Hegde
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 15

PART-A

1. Convert Regular Expression (11+0)*(00+1)* to Finite Automata.

2. Convert Regular Expression to Regular Grammar for the following


Expressions
i.a(a +b)*
ii.(aa +bb)
3. Describe Pumping Lemma for Regular Languages. Prove that the
language L = {a n /n is n5 } is not regular

4. Describe the DFA Transition diagram for equivalent Regular expression


(ab+a) *(aa+b)

5. Convert the following Regular Expression (0 + 1)*(00 + 11)(0 + 1)* to DFA.

6. Convert the following Regular expression (0+1)*(01+110) to NFA.


7. Convert the following automata into Regular expression M=({q1,q2,q3},{0,1},
δ, q1, {q2,q3}) where δ is given by [δ (q1,0)={q2}, δ (q1,1)={q3}] [δ
(q2,0)={q1}, δ (q2,1)={q3}] [δ (q3,0)={q2}, δ (q3,1)= {q2}]

8. Describe the following language is not regular


i)L = {a n b an /n = 0, 1, 2. . . . . . .}
ii) L= {a n b 2 n /n≥ 0 }

9. Convert the automata in which strings end with 101 over an alphabet P ={0,1}
to the Left Linear Grammar and Right Linear grammar.

10. Convert the following Finite Automata to regular expression.


PART-B
1. Convert Regular Expression 01* + 1 to Finite Automata.

2. Convert Regular Expression 01* + 1 Right linear, Left linear Regular


Grammars
3. Describe Regular expressions? Simplify the following Regular Expression
i)ϵ+1*(011)*(1*(011)*)*= (1+011)*
ii)(0+11∗0)+(0+11∗0)(10+10∗1)∗(10+10∗1)∗ = 1 ∗ 0(10 + 10 ∗ 1)∗
Regular Expressions:
● The language accepted by finite automata can be easily described
by simple expressions called Regular Expressions. It is the most
effective way to represent any language.
● The languages accepted by some regular expressions are referred
to as Regular languages.
● A regular expression can also be described as a sequence of
pattern that defines a string.
4. Convert the given Finite Automata (a+b)*ab* to Regular grammar .

5. Convert the given Finite Automata 0*11(0+1)*to Regular grammar .


6. Describe Regular expression, Regular set and Finite Automata.
Distinguish those with example representations.

7. Convert Regular Expression (0+1)*00(0+1)* to the Finite Automata(NFA-


ϵ)
8. Convert Regular Expression (b+aa)*a* to Finite Automata(NFA-ϵ).

9. State Pumping Lemma for Regular Languages with a suitable example.

10. Convert given Regular expression (a*b* ) * to FA(NFAϵ).


11. Convert the following automata into Regular expression M=( {q1,q2,q3 } ,
{0,1 } , δ, q1, {q1 }) where δ is given by [ δ (q1,0)= {q1 } , δ (q1,1)= {q2 } ]
[ δ (q2,0)= {q3 } , δ (q2,1)= {q2 } ] [ δ (q3,0)= {q1 } , δ (q3,1)= {q2 } ]

12. Describe Pumping lemma. Prove that the language


L= {yy/y belongs {0,1 } * } is not regular.

13. Describe Regular grammar? Explain the types of regular grammar with
examples.
14. Illustrate the steps for conversion of regular grammar to finite automata?
Construct the FA for the following grammar S aS/bA/b ,A aA/bS/a

15. Convert the given Regular Expression 1(11) * to FA and convert it into
NFA.

16. Show that the following languages is not regular L = { a n b n/ n ≥ 1} L= {aP/p


is prime }
17. Convert the following regular expression to Regular grammar
(0+1)*00(0+1)*
18. Describe the Left Linear Grammar for the strings starting with ‘a’ over an
alphabet P ={a,b}.

19. Illustrate the steps for conversion from Finite Automata to Regular
Expression with an example?

20. Describe Pumping lemma. Prove that the language L={yy/y belongs
{0,1}*} is not regular.

PART-C
1. Define Regular Languages.
2. List out any two applications of regular expression.
3. Define Pumping Lemma for Regular Languages.
4. Show an example for a regular set?
5. Define the Regular Expression for the empty string.
6. Describe regular expression for denoting language containing empty.
7. Define right linear grammars.
8. Show the Regular Expression for the set of binary strings.
9. Define Regular grammars.
10. List out the advantages of regular expressions.
11. Define a Regular set?
12. Describe regular expressions for the Set of strings over 0, 1 whose last
two symbols are the same.
13. Describe the regular language generated by regular expression
(0+1)*001(0+1)*.
14. List the difference between left linear and right linear grammars.
15. Describe the Regular Expression to generate at least one b over Σ ={a,b}
16. Describe that following languages are not regular
L={a n b m∨n , m and n<m }
17. Describe that following languages are not regular
L={a n∨n is a perfect square}
18. Define Regular Expression for even numbers of 0’s.
19. Define Regular Expression for an odd number of 0’s.
20. Define Regular Expression for the regular sets consisting of strings
having two consecutive a’s.

You might also like