1,316 views

1 Answer

Best answer
0 votes
0 votes

Yes it's DCFL.

1. Push all a's and b's
2. if c comes, then ignore this c and pop all the b's
3. when a's come again, pop one 'a' from stack for every input 'a'
4. input is completed and stack contains stack contains stack symbol on TOS, accept the language.

1. Push all a's and b's
2. if d comes, then ignore this d
3. when b's come again, pop one 'b'  from stack for every input 'b'
4. input is completed and stack contains 'a' on the top of the stack, then accept the language

selected

Related questions

2 votes
2 votes
3 answers
1
2 votes
2 votes
1 answer
2
srestha asked Nov 26, 2018
542 views
$L_{1}=\left \{ 0^{m}.1^{n}.2^{m}.3^{n} \right |n,m>0\}$$L_{2}=\left \{ a^{i}.b^{j}.c^{k}.d^{l} \right |i+k=j+l\}$which one DCFL?Refrence :https://gateoverflow.in/15327/c...
0 votes
0 votes
0 answers
3
Na462 asked Sep 11, 2018
697 views
Consider the following languages :L1: {a bn a2n | n ≥ 0 }L2: { a a bn a3n | n ≥ 0 }Which of the following is true ?A. L1 U L2 is regularB. L1 U L2 is DCFLC. L1 inters...
1 votes
1 votes
1 answer
4