retagged by
288 views

1 Answer

0 votes
0 votes

We know

1. Every regular grammar is a CFG

2. Concatenation of any two CFGs is a CFG

Since (a+b)* is regular, it is a CFG also. So its concatenation with another CFG a^n b^n also must be a CFG

Related questions

2 votes
2 votes
1 answer
1
Souvik33 asked Nov 23, 2022
302 views
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
3 votes
3 votes
2 answers
2
1 votes
1 votes
1 answer
3
jugnu1337 asked Apr 16, 2023
348 views
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
1 votes
1 votes
2 answers
4
atulcse asked Jan 21, 2022
677 views
Is the following language a DCFL? Please explain your reasoning.