677 views
1 votes
1 votes

Is the following language a DCFL? Please explain your reasoning.

2 Answers

2 votes
2 votes
it is CFL language  here pop and push not determinsitic

let us suppose you pushing all a in stack after that b become then how you decide  how many b    a pop  and remaining of b push in stack  to compare with c so here nondetermenism exist so it is cfl not dcfl
0 votes
0 votes
it is CFL language  here pop and push not determinsitic

let us suppose you pushing all a in stack after that b become then how you decide  how many b    a pop  and remaining of b push in stack  to compare with c so here nondetermenism exist so it is cfl not dcfl

Related questions

1 votes
1 votes
1 answer
1
4 votes
4 votes
2 answers
2
srestha asked Jun 22, 2018
1,538 views
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$$\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$$\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$Which one DCFL...
1 votes
1 votes
2 answers
3
atul_21 asked Dec 21, 2017
847 views
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$$L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$1. L1 is DCFL, L2 is not2. L2 is DCFL, L1 is not3. Both are not DCFL...
0 votes
0 votes
0 answers
4