0 votes 0 votes Give regular Expression for the language L={an bm | n≥1, m≥1, nm≥3} Theory of Computation theory-of-computation regular-expression peter-linz peter-linz-edition4 + – Ayush Upadhyaya asked Mar 9, 2017 • retagged May 6, 2021 by Shiva Sagar Rao Ayush Upadhyaya 2.6k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Ayush Upadhyaya commented Mar 9, 2017 reply Follow Share Since nm>=3 so there will be 2 cases (1)When n>=1 and m>=3 so that nm>=3 Regular exp for such language : aa*bbbb* (2)When n>=3 and m>=1 so that nm>=3 Regular exp for such language : aaaa*bb* So regular exp for this language according to me is : aa*bbbb* + aaaa*bb* Please someone verify this. 0 votes 0 votes Shiva Sagar Rao commented May 6, 2021 reply Follow Share https://gateoverflow.in/207494/peter-linz-edition-4-exercise-3-1-question-10-page-no-76 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes $aaa^{+}b^{+}+abbb^{+}+aabb^{+}$ 2018 answered Mar 9, 2017 • edited Mar 9, 2017 by 2018 2018 comment Share Follow See all 4 Comments See all 4 4 Comments reply Ayush Upadhyaya commented Mar 10, 2017 reply Follow Share We can modify the last case as from aabb+ as aa+bb+ to handle even number of a's and b's. 0 votes 0 votes 2018 commented Mar 10, 2017 reply Follow Share that is included in aaa+b+ 0 votes 0 votes Ayush Upadhyaya commented Mar 10, 2017 reply Follow Share We can have more than one answer as regular exp to a language right? 0 votes 0 votes 2018 commented Mar 10, 2017 reply Follow Share right, regular expression is not unique 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I think this is write ans aaa+b++a+bbb+ or aaaa*bb*+aa*bbbb* anonymous answered Mar 27, 2017 anonymous comment Share Follow See all 0 reply Please log in or register to add a comment.