Unit/Title:

Maharaja Agrasen Institute of Technology

Department: Information Technology

Assignment No: 2

Subject Name: Theory of Computation

Subject Code: ETCS- 206

Issue
Date:

Last date:

Faculty:
Bhaskar
Kapoor

Semester: 4th

UNIT-I and UNIT-II

Pages: 3
I-Term Exam
15/2/2016 Day

1. What do you mean by Regular Expression?Explain the operations on Regular

Expressions.
2. Write the Identity Rules for Regular Expressions.
5. Write the procedure to obtain -NFA from Regular Expression (Kleens Theorem
Part 1)
4. Write the procedure to obtain Regular Expression from Finite Automata (Kleens
Theorem Part 2)
5. Write the general procedure to obtain Regular Expression from Finite Automata by
Eliminate States.
6. Write the procedure to obtain Regular Expression from DFA using Ardens Method.
7. Explain the closure properties of Regular Languages.
8. Explain Pumping lemma of Regular language.
9. Write the procedure to obtain Regular Grammar from Finite Automata.
10. How can we find Regular Grammar to Regular Expression or Regular Expression
to Regular Grammar?
11. (i) Construct a regular expression of a and b containing at least 2 as.
(ii) Construct a Regular Expression of a and b containing at least 2 as.
12. (i) The set of all Strings that has no pair of consecutive zeros.
(ii) The set of all Strings ending with either with double b or single a.
13. Write Regular Expression for Language containing the strings of length 2 over
={0, 1}.
14. Write Regular Expression for Language L= {an bm| where m+n is even}.
15. Write a Regular Expression to denote a Language L which accepts all the Strings
which begin with or end with either 00 or 11.
16. Describe the Set of all Strings of 0s and 1s ending in 00 by Regular Expression.
17. Describe the Set of all Strings of 0s and 1s begin with 0 and ending in 1 by Regular
Expression.
18. Describe the Set of all Strings having even number of 1s by Regular Expression.
19. Describe the Set of all Strings of 0s and 1s with at least two consecutive 0 by
Regular Expression.

20. Convert the Regular Expressions (Given below) to NFA using Kleenes Theorem or
using Thompson Construction.
(i) (0+1)*1(0+1)
(ii) (00+1)(10)*
21. Design a FA from given Regular Expression 10+ (0+11)0*1(Hint:-first convert it
into Regular Expression using Direct Method in to NFA then convert in to DFA)
22. Construct FA equivalent to the Regular Expression (0+1)*(00+11)(0+1)*
23. Obtain a Regular Expression for the FA shown below:

What is the Language corresponding to the Regular Expression?

24. Construct a Regular Expression for the FA (Using Method of Eliminate States) the
shown below:

25. Construct a Regular Expression from the given FA by Algebraic Method using
Ardens Theorem.

26. Construct a Regular Expression from the given FA by Algebraic Method using
Ardens Theorem.

27. Using pumping lemma Prove that(i) Language L= (0p1m2p | p and m are arbitrary integers) is not regular.
(ii) Language L= { 0p1m | p m} is not regular.
(iii) Prove that the Set of Strings of the form wwR over the alphabet {0,1} is not regular.
(iv) Prove that the language L={ 0n |n is Perfect Square} is not regular.
28. (i) Construct a Regular Grammar G generating the regular expression 0*(0+1)*
(ii) Construct a regular grammar G generatingthe Regular set represented by
{a,aa,aaa,aaaa,..}
29. Consider the regular Grammar G={[A0,A1],{0,1},{A00A1,A11A1|0|1A0},A0).
Construct the transition System M,which accepts the language generated by Grammar
G.
30. Consider the following Productions of the Regular Grammar G:
SaA|a, AaA|aB|a, BbB|c.
Find the Regular Expression corresponding to Regular Grammar G.