Toc QB M2
Toc QB M2
Module 2
1 Write regular expression for the following language: June- July 2021
{String of a’s and b’s having two consecutives a’s} 8 marks
ii) { string of a’s and b’s whose 3rd symbol from right end is a}
iii) L= { w : | w | mod 3 = 0}
2 Obtain a regular expression for the DFA shown below using Kleen’s June- July 2021
theorem: 10 Marks
4 Prove that every language define by a regular expression is also Dec 2021
defined by Finite Automata. 10 Marks
5 Define regular expression. Write the regular expression for the June- July 2021/
following language: Dec 2021
i) Language of all string ω such that ω contains exactly one 1 an 8Marks
even number of 0’s
ii) Set of strings over {0,1,2} containing atleast one 0 and one 1.
6 Convert the following DFA to regular expression June- July 2020
10Marks
7 Obtain the regular expression to accept string of a’s , b’s and c’s Dec 2020
such that fourth symbol from the right is :a and ends with : b. 4Marks
8 Define regular expression. Write the regular expression for the July 2019
following language: 6 Marks
ii) Strings of 0’s and 1’s having no two consecutive zeros
iii) String of 0’s and 1’s whose length are multiples of 3
9 Write a note on applications of regular expression. July 2019
6 Marks
10 State pumping lemma for regular language. Prove that the language July 2019
{a n b m | n≥ 1} is a non regular . 6 Marks
11 Apply pumping lemma for the following language anf prove that July 2019
they are not regular: 6 Marks
i) L = {w w R | w ε(0+1)*}
ii) ii) L = {a n b n | n≥ 0}. (10