Register

Concatenation of DCFLs

601 views
0 votes
0 votes

L1={an bn | n>=0}

L2={bn cn | n>=0}

What is L1.L2 ?

Is it an b2n cn ?

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
vedantk asked Jan 10
150 views
Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?
If it’s DCFL then also construct the DPDA ?
User Avatar
1 votes
1 votes
2 answers
2
ggwon asked Dec 29, 2022
727 views
DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$} Is the above language DCFL or CFL ?
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?
User Avatar
3 votes
3 votes
2 answers
3
Tuhin Dutta asked Jan 27, 2018
1,196 views
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________ a. Regular b. DCFL but not Regular c. CFL but not DCFL d. REC but not DCFL
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________a. R...
User Avatar
3 votes
3 votes
1 answer
4
saurabh rai asked Oct 21, 2016
1,132 views
Context free language
Is the language $L=\left \{ (0^{n}1^{n})^{*} |n\geq 0 \right \}$ is DCFL ?
Is the language $L=\left \{ (0^{n}1^{n})^{*} |n\geq 0 \right \}$ is DCFL ?
User Avatar
Link Copied!