Recent questions tagged dcfl

Suppose $L$ is a deterministic context-free language.Which of the following is always correct about$$L^R=\{w^R\mid w\in L\}?$$$L^R$ must be regular. $L^R$ must be determi...

Consider $$L= \{a^ib^jc^k\mid i=j\text{ or }j=k\}.$$ Which of the following correctly classifies $L$?$L$ is regular. $L$ is DCFL but not regular. $L$ is CFL but not DCFL....

Let $L_1,L_2$ be deterministic context-free languages and let $R$ be a regular language.Which of the following statements are always true?$L_1\cup L_2$ is deterministic c...

Let $L=\{w\in\{a,b\}^*\mid n_a(w)\ne n_b(w)\}$. Which statements are correct?$L$ is regular. $L$ is DCFL. $L$ is not CFL. A DPDA can maintain the current surplus using th...

Let $L_1=\{wcw^R\mid w\in\{a,b\}^*\}$ and $L_2=\{ww^R\mid w\in\{a,b\}^*\}$. Which statements are correct?$L_1$ is a DCFL. $L_2$ is a DCFL. $L_2$ is a CFL. $L_2$ is not ac...

Let $L=\{a^i b^j c^k\mid i=j\text{ or }j=k,\ i,j,k\ge0\}$. Which statements are correct?$L$ is a CFL. $L$ is a DCFL. $L$ can be written as union of two CFLs: one checking...

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...

Let $A=\{a^n b^n\mid n\ge1\}$. Define $L_a=A\cup\{a\}$ and $L_b=A\cup\{b\}$. Which statements are correct?$L_a$ is a DCFL. $L_b$ is a DCFL. Both $L_a$ and $L_b$ are regul...

Which statement about deterministic context-free languages is correct?DCFLs are closed under reversal. If $L$ is a DCFL, then $L^R$ must also be a DCFL. There exists a DC...

Let $L_1$ be a DCFL and $R$ be a regular language over the same alphabet. Which languages are guaranteed to be DCFL?$L_1\cap R$ $L_1\cup R$ $L_1-R$ $L_1^R$ $L_1\cap L_2$,...

Let $L_1=\{a^i b^j c^i \mid i,j>0\}$ and $L_2=\{a^i b^i c^j \mid i,j>0\}$. Which statements are correct?$L_1$ is a DCFL. $L_2$ is a DCFL. $L_1\cap L_2=\{a^n b^n c^n \mid ...

How a^i b^j | i !=(2j+1) is dcfl?

If it’s DCFL then also construct the DPDA ?

Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?

L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?

I tried to solve but got stuck here.

Consider the following statement:S : {$a^{n}b^{n+k} | n\geq 0,k\geq 1$} $\cup$ {$a^{n+k}b^{n} | n\geq 0,k\geq 3$}Which of the following is TRUE about S? (Also explain HOW...

If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE

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

$L1 =\left \{ a^{m} b^{n} c^{p} | \left ( m \geq n \right )\text{or} \left ( n = p \right ) \right \}$ $L2 =\left \{ a^{m} b^{n} c^{p} | \left ( m \geq n \right )\text{a...