432 views

1 Answer

Best answer
1 votes
1 votes
It's a REGULAR language,.
If n>=1 or anything it's just a (a+b)*

Now, you have choice to take n as any number.

Consider every string as a part of
(a+b)* and if n>=1 then start string with 'a' and End that string with just 'b' and if n>=0 then it's simply a (a+b)*
(Like we do this in palindrome's sums)

FA:
(a,b)--a-->(a,b)--b-->()

For eg. String is bababaabb
(bab) a (baab) b
selected by

Related questions

2 votes
2 votes
3 answers
1
0 votes
0 votes
1 answer
2
mehul vaidya asked Sep 3, 2018
526 views
To find intersection of this two : If i proceed like thisregular ∩ CFG CFG ∩ CFG as regular lang is also CFGbut CFG is not closed under intersectionhence answer ma...
0 votes
0 votes
0 answers
3
mehul vaidya asked Aug 25, 2018
404 views
will intersection of regular and context free be always CF? I don't think so , because regular Language is also cf hence CFL intesect CFL is no always CFLref: https://gat...