495 views

2 Answers

1 votes
1 votes
Complement of the language L=a<4 & b≤3 will be

L'= a≥4 or b>3 (which is also equal to b≥4).

So, regular expression for L' can be written as

L'= a⁴a*b* +a*b⁴b*.
0 votes
0 votes

let me know if there is any shorter way

Related questions

2 votes
2 votes
1 answer
1
Ayush Upadhyaya asked Mar 10, 2017
1,239 views
Give a regular expression for the language over {0,1}NOT CONTAINING 101 AS SUBSTRING.
0 votes
0 votes
2 answers
2
0 votes
0 votes
2 answers
3
0 votes
0 votes
1 answer
4
Ayush Upadhyaya asked Mar 9, 2017
226 views
Give regular expression for all strings that contain no run of a's greater than two.The input alphabet set consists of {a,b,c)