Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by KiranWatts
1
answer
1
#finding out regular expression for given regular language
I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume. Thanks & Regards, Kiran Watts
I am finding very difficulty to find out regular expression for given regular language. Kindly explain me the entire procedure to get the correct answer in minimum tume.T...
505
views
commented
Jan 16, 2017
Theory of Computation
theory-of-computation
regular-expression
regular-language
+
–
3
answers
2
UGC NET CSE | June 2016 | Part 3 | Question: 23
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is: $(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ba(a+b)^*$
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is:$(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$$(\lambda +a+aa+aaa...
4.2k
views
commented
Jan 16, 2017
Theory of Computation
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register