Register

REgular and cfl

459 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
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Vedantthakkar asked Feb 24
161 views
CFL and regular language
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR,∑,δR,q0R,FR).
Consider a regular language R and a context free language C. Let the PDA that recognizes C be called P=(QP,∑,Γ,δP,q0P,FP), and the DFA that reconginzes R be (QR...
User Avatar
2 votes
2 votes
3 answers
2
jugnu1337 asked Dec 23, 2021
1,216 views
regular and cfl
if L1 and L2 are not regular language then L1 union L2 is not regular. this statement is true or false? my approach is::: true let suppose L1= a^n b^n AND L2= a^k b^k both are cfl but if we do union then that also be cfl and what happened if union is replaced by concatenation L1 . L2
if L1 and L2 are not regular language then L1 union L2 is not regular.this statement is true or false?my approach is:::true let suppose L1= a^n b^n AND L2= a^k b^kbot...
User Avatar
0 votes
0 votes
1 answer
3
mehul vaidya asked Sep 3, 2018
542 views
is intersection of CFL and Regular Lang always context free
To find intersection of this two : If i proceed like this regular ∩ CFG CFG ∩ CFG as regular lang is also CFG but CFG is not closed under intersection hence answer may not be CFG.
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...
User Avatar
0 votes
0 votes
0 answers
4
mehul vaidya asked Aug 25, 2018
425 views
intersection of CFL and regular
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 CFL ref: https://gateoverflow.in/3571/gate2006-it-32
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...
User Avatar
Link Copied!