Theory of Automata
Assignment #2
Part #2
Regular Expression # 6
The set of strings over {a,b} that contain at least two a's or exactly two b's.
(a+b)*(a)(b*)a(a+b)*+a*b(a*)b(a*)
Regular Expression # 7
The set of strings over {a,b} that contain even length but not multiple of 3
(aa*)(aaa^)
Regular Expression # 8
The language over {a,b}contains exactly one double letter.
(ε + b)(ab)
∗aa(ba)
∗(ε + b) + (ε + a)(ba)
∗
bb(ab)
∗(ε + a)

Comments
Post a Comment