Register

UNION of two Languages

• reopened by
911 views

1 Answer

Best answer
1 1 vote

DCFL Union Regular language = DCFL

Source:
https://cs.stackexchange.com/questions/58019/union-of-a-deterministic-context-free-language-and-a-regular-language-is-a-deter

Here L1={an∣n≥0}  

L1 is a regular language.
L2 = {anbn∣n≥0}
L2 is DCFL.
L= L1 Union L2
​​​​​​​L is a DCFL.

• selected by
Voting & Accepting an answer helps improve the community
← Previous · QueueNext → · How to draw PDA for ...
← Previous in category · Regular languageNext in category → · How to draw PDA for ...
Position:
Show:

Related questions

2 2 votes
0 0 answers
3.6k
3.6k views
sunil sarode asked Jan 19, 2018
3,622 views
Union of two DCFL is ?
Consider two languages LA and LB over Σ={a,b}.LA= {a^ib^ja^k | i,j,k ≥ 0 and j=i+k}LB= {b^ia^jb^k | i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regular B ...
1 1 vote
1 1 answer
57
57 views
GO Classes asked Sep 17
57 views
GO Classes DPP | GATE CS | Theory of Computation | Union of DCFL
Let $L_1=\{a^n b^n\mid n\ge0\}$, $L_2=\{a^n b^{2n}\mid n\ge0\}$, and $L=L_1\cup L_2$.Which statements are correct?$L_1$ is a DCFL. $L_2$ is a DCFL. $L$ is a CFL. $L$ is a...
0 0 votes
1 answers 1 answer
724
724 views
juuniversity asked Jun 22, 2022
724 views
Dcfl union Regular not always dcfl?
$L=\{a^mb^n\mid m≠n\}∪{(a+b)^∗b(b+a)^*a(a+b)^∗}$$\implies L = \;\{a^mb^n\mid m<n\} \cup \{a^mb^n\mid m>n\} \cup (a+b)^*b(a+b)^*a(a+b)^*$ It is DCFL ∪ Regular, hence it s...
2 2 votes
0 0 answers
1.2k
1.2k views
Tuhin Dutta asked Jan 18, 2018
1,219 views
Intersection of two DCFLs
$ L_1\ =\ \{ \ a^mb^mb^na^n | m,n\ >\ 0\}\\ L_2\ =\ \{ \ a^mb^na^nb^m | m,n\ >\ 0\}$Find $L_1 \cap L_2$