Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged cfl
0
0 votes
1
1 answer
13
13 views
GO Classes DPP | GATE CS | Theory of Computation | CFL Classification
Let $P=\{a^n\mid n\text{ is prime}\}$.Which statements are correct?$P$ is regular. $P$ is CFL but not regular. If $P$ were CFL, then because it is unary, it would have to...
GO Classes
13
views
asked
5 hours
ago
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-375
goclasses-toc-practice-questions
cfl
multiple-selects
+
–
0
0 votes
1
1 answer
10
10 views
GO Classes DPP | GATE CS | Theory of Computation | CFL Classification
Let $\text{COPY}=\{ww\mid w\in\{a,b\}^*\}$ and $\text{NOTCOPY}=\{x\in\{a,b\}^*\mid x\text{ is not of the form }ww\}$.Which statements are correct?$\text{COPY}$ is not CFL...
GO Classes
10
views
asked
5 hours
ago
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-375
goclasses-toc-practice-questions
cfl
multiple-selects
+
–
0
0 votes
1
1 answer
11
11 views
GO Classes DPP | GATE CS | Theory of Computation | CFL Pumping Lemma
Let $B=\{0^n\#0^{2n}\#0^{3n}\mid n\ge0\}$.Which statements are correct for proving $B$ is not CFL using the pumping lemma?Choose $s=0^p\#0^{2p}\#0^{3p}$, where $p$ is the...
GO Classes
11
views
asked
5 hours
ago
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-375
goclasses-toc-practice-questions
cfl
pumping-lemma
multiple-selects
+
–
0
0 votes
1
1 answer
10
10 views
GO Classes DPP | GATE CS | Theory of Computation | CFL Classification
Let $A=\{w\in\{a,b,c\}^*\mid \#a(w)=\#b(w)=\#c(w)\}$ and let $R=a^*b^*c^*$. Which statements are correct?$R$ is regular. If $A$ were CFL, then $A\cap R$ would be CFL. $A\...
GO Classes
10
views
asked
5 hours
ago
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-375
goclasses-toc-practice-questions
cfl
multiple-selects
+
–
0
0 votes
1
1 answer
11
11 views
GO Classes DPP | GATE CS | Theory of Computation | CFL Classification
Consider the following languages:$L_1=\{w\in\{a,b\}^*\mid \#a(w)=\#b(w)\}$$L_2=\{w\in\{a,b,c\}^*\mid \#a(w)=\#b(w)=\#c(w)\}$$L_3=\{a^m b^n\mid 5m+4n=44,\ m,n\ge0\}$Which ...
GO Classes
11
views
asked
6 hours
ago
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-375
goclasses-toc-practice-questions
cfl
multiple-selects
+
–
To see more, click for the
full list of questions
or
popular tags
.