484 views
0 0 votes
$$
L = \{\, a^{n} b^{m} c^{k} \mid n,m,k > 0 \text{ and } k = |n-m| \,\}
$$
Is it dcfl or cfl ?
my approach

We can split the condition \(k = |n - m|\) into two cases:

Case 1:\(n \ge m\), so \(k = n - m\):
\[
L_1 = \{\, a^{n} b^{m} c^{\,n-m} \mid n \ge m > 0 \,\} => dcfl
\]

Case 2: \(m \ge n\), so \(k = m - n\):
\[
L_2 = \{\, a^{n} b^{m} c^{\,m-n} \mid m \ge n > 0 \,\} => dcfl
\]

Hence,
\[
L = L_1 \cup L_2. => dcfl \cup dclf is \ not \  closed \ under \ dclf => cfl
\]
 

Please log in or register to answer this question.

Position:
Show:

Related questions

1 1 vote
1 1 answer
126
126 views
Shubham Sharma 2 asked Apr 19
126 views
Which of the following languages cannot be accepted by push down automata?$\mathrm{L}=\left\{\mathrm{a}^\mathrm{n} \mathrm{b}^{n} c^\mathrm{n}: \mathrm{n} \geq 0\right\}$...
3 3 votes
0 0 answers
394
394 views
Deepak Poonia asked Nov 20, 2024
394 views
Show that $L = \{a^nb^m,n< 2m \}$ is a deterministic context-free language.
1 1 vote
1 1 answer
589
589 views
vedantk asked Jan 10, 2024
589 views
If it’s DCFL then also construct the DPDA ?