Scribd
Upload
6K views

Assignment 2sou

This document contains regular expressions and descriptions of the languages they define. It also contains proofs that certain regular expressions define the same language. 1. It defines regular expressions for languages with specific constraints on the letters a and b, such as only containing strings where a is tripled or b is never tripled. 2. It proves that three pairs of regular expressions (ab)*a and a(ba)*, (a*1b)* and (a1b)*, and (a*1b*)* and (a1b)* all define the same language. 3. It provides English descriptions of the languages defined by the regular expressions (a(a1bb)*)*, (b(

Uploaded by

Rushna Munir
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
6K views

Assignment 2sou

This document contains regular expressions and descriptions of the languages they define. It also contains proofs that certain regular expressions define the same language. 1. It defines regular expressions for languages with specific constraints on the letters a and b, such as only containing strings where a is tripled or b is never tripled. 2. It proves that three pairs of regular expressions (ab)*a and a(ba)*, (a*1b)* and (a1b)*, and (a*1b*)* and (a1b)* all define the same language. 3. It provides English descriptions of the languages defined by the regular expressions (a(a1bb)*)*, (b(

Uploaded by

Rushna Munir
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

1. All words in which a appears tripled, iI at all.

This means every clump oI a`s contains


3 or 6 or 9 or 12 .. a`s.
(aaab)*
2. All words that contain exactly two b`s or exactly three b`s, not more.
A*ba*ba*(b )a*
3. (i) All strings that end with a double letter.
(ii) All strings that do not end in a double letter.
(i) (ab)*(aabb)
(ii) (ab)*(abba) a b
4. All strings that have exactly one double letter in them.
(b )(ab)*aa(ba)*(b) (a)(ba)*bb(ab)*(a)
5. All strings in which the letter b is never tripled. This means that no word contains the
substring bbb.
(ababba)*(bbb)
6. All words in which a is tripled or b is tripled, but not both. This means each word
contains the substring aaa or the substring bbb, but not both.
(ababba)*(bbb)aaa(ababba)*(bbb)
(babaab)*(aaa)bbb(babaab)*(aaa)
7. All strings in which the total number oI a`s is divisible by 3 no matter how they are
distributed, such as aabaabbaba.
(b*ab*ab*ab*)*
8. Show that the Iollowing pairs oI regular expressions deIine the same language over
the alphabet a b}
(i) (ab)*a and a(ba)*
(ii) (a*b)* and (ab)*
(iii) (a*b*)* and (ab)*
(i). (ab)*a consists oI all strings (ab)
n
a Ior n 0, 1, ..
a(ba)* consists oI all strings a(ba)
n
Ior n 0, 1, ..
Using induction, we can prove (ab)
n
a a(ba)
n
Ior all n`s
1) (ab)
0
a a(ab)
0
a.
2) Assume (ab)
n-1
a a(ba)
n-1

(ab)
n
a (ab)
n-1
aba ((ab)
n-1
a)ba a(ba)
n-1
ba a(ba)
n
(ii). (ab) (a*b) , so (ab)* (a*b)*
Because (ab)* contains all strings on a b}, so (a*b)* (ab)*.
(iii) (ab) (a*b*) , so (ab)* (a*b*)*
Because (ab)* contains all strings on a b}, so (a*b*)* (ab)*.
9. Describe in English the languages associated with the Iollowing regular expressions.
(i). (a(abb)*)*
All words that do not begin with b and in which b`s appear in clumps oI even lengths.
(ii). (b(bb)*)*(a(aa)*b(bb)*)*
all words that start with 0 or more b`s Iollowed by odd number o a`s and b`s.
(iii). ((ab)a)*
all words with even lengths and in which each b is separated by some a`s and a
occupies all even positions.
10. Find a DFA accepting the language 10(011)0*1
0
0
1 1 1 0,1
0 0,1

You might also like