Register

Recent questions tagged dcfl

0 votes
0 answers
2
Can
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
User Avatar
2 votes
0 answers
3
Can DCFL be ambiguous?
Can DCFL be ambiguous?
Can DCFL be ambiguous?
User Avatar
1 votes
2 answers
4
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
1 votes
1 answer
7
TOC | Made Easy Test Series | Q.13
Consider the following statement S: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFL The above statement is: TRUE FALSE
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
User Avatar
1 votes
2 answers
11
DCFL - TOC
Is the following language a DCFL? Please explain your reasoning.
Is the following language a DCFL? Please explain your reasoning.
User Avatar
1 votes
0 answers
13
Made Easy Test Series : Doubt on Automata
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFL Is it true? As we know union of two DCFL cannot be DCFL
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFLIs it true? As we know union of two DCFL cannot be ...
User Avatar
0 votes
1 answer
16
context free grammer
consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL?
consider following grammerS → aSb / aSbb / aSbbb / …..is language generated by above grammer is DCFL?
User Avatar
2 votes
1 answer
18
Language DCFL?
$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/context-free-or-not I think both not DCFL, but need valid reason for it
$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...
User Avatar
1 votes
1 answer
19
DCFL_
state true /false 1) for every DCFL there exist at least one unambiguous grammar
state true /false1) for every DCFL there exist at least one unambiguous grammar
User Avatar
0 votes
0 answers
20
own doubt
can we say that every regular language is a DCFL?
can we say that every regular language is a DCFL?
User Avatar
0 votes
0 answers
21
Concatenation of DCFLs
L1={an bn | n>=0} L2={bn cn | n>=0} What is L1.L2 ? Is it an b2n cn ?
L1={an bn | n>=0}L2={bn cn | n>=0}What is L1.L2 ?Is it an b2n cn ?
User Avatar
0 votes
0 answers
22
DCFL Language
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 regular B. L1 U L2 is DCFL C. L1 intersection L2 is non regular D. L1 U L2 is not CFL
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...
User Avatar
0 votes
0 answers
23
test series
L1 = {a^mb^nc^p | m ≥ n or n = p} L2 = {a^mb^nc^p | m ≥ n and n = p} (a) Both are NCFL’s (b) L1 is DCFL and L2 is NCFL (c) L1 is NCFL and L2 is not context-free (d) Both are not context-free Solution: Option (c) how it is possible plz explain indetail
L1 = {a^mb^nc^p | m ≥ n or n = p}L2 = {a^mb^nc^p | m ≥ n and n = p}(a) Both are NCFL’s(b) L1 is DCFL and L2 is NCFL(c) L1 is NCFL and L2 is not context-free(d) Both...
User Avatar
0 votes
0 answers
25
Regular language
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not???
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k 5 \right \}$ is regular or not???
User Avatar
4 votes
2 answers
26
DCFL or Not
$\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, CFL or CSL?
$\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...
User Avatar
2 votes
0 answers
30
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 CFL but not DCFL C None of the above D CSL but not CFL
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 regul...
User Avatar
Page: