Question: ( a ) Let = { a , b } . Write regular expression for the language L consisting of all strings in * that

(a) Let ={a,b}. Write regular expression for the language L consisting of all strings in *
that
i. contain exactly one occurence of the substring a
ii. contain exactly one occurence of the substring aa
iii. contain exactly one occurence of the substring aaa
(b) Simplify the following regex, explaining your reasoning
((11)*1*)*+(11+1)*+(0+lon)*
( a ) Let = { a , b } . Write regular expression

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!