Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged context-free-language
0
votes
0
answers
31
Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?
PDA for $a^i b^j | i \neq 2j+1$ ?
jaisyking
187
views
jaisyking
asked
Jan 12, 2023
Theory of Computation
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
+
–
1
votes
1
answer
32
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language. L= (a²ⁿ b³ⁿ | n ≥ 0}
Construct pushdown automata that recognize the following language.L= (a²ⁿ b³ⁿ | n ≥ 0}
M_Umair_Khan42900
292
views
M_Umair_Khan42900
asked
Dec 29, 2022
Theory of Computation
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
+
–
1
votes
2
answers
33
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 ?
ggwon
701
views
ggwon
asked
Dec 29, 2022
Theory of Computation
dcfl
context-free-language
theory-of-computation
identify-class-language
+
–
2
votes
0
answers
34
Is it CFL or CSL?
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more than 1 stack? Please tell how would check for the grammer of this language even if it is in CSL. Thank you
Is {$a^nb^nc^n$ | $n>=0$} CSL? After comparing both a and b, stack would be empty. So it can’t be CFL. So it is CSL or recursive. And does this language require more th...
h4kr
279
views
h4kr
asked
Dec 23, 2022
Theory of Computation
theory-of-computation
context-free-language
context-sensitive
pushdown-automata
+
–
0
votes
1
answer
35
#Self Doubt
L = {0^n 1^2n 0^n+m , n,m>=0} Is this Language CFL or non CFL? According to me we can write this as 0^n 1^n 1^n 0^n 0^m Then we will keep on pushing 0's and as and when we get 1 we keep on popping 0's, now once the stack is ... then on seeing any number of 0's we don't push anything and when we reach the end of the string we simply move to the final state. Is this logic correct?
L = {0^n 1^2n 0^n+m , n,m>=0}Is this Language CFL or non CFL?According to mewe can write this as 0^n 1^n 1^n 0^n 0^mThen we will keep on pushing 0’s and as and when we ...
Sunnidhya Roy
592
views
Sunnidhya Roy
asked
Dec 12, 2022
Theory of Computation
theory-of-computation
dcfl
pumping-lemma
context-free-language
+
–
0
votes
0
answers
36
context free
Let $L = \{a^nb^nc^nd^n | n\ge1\}$. Show that $L$ can be expressed as the intersection of two context-free languages.
Let $L = \{a^nb^nc^nd^n | n\ge1\}$. Show that $L$ can be expressed as the intersection oftwo context-free languages.
moe12leb
320
views
moe12leb
asked
Dec 3, 2022
Theory of Computation
theory-of-computation
context-free-language
+
–
1
votes
1
answer
37
Autometa | PDA
Consider the following Language: L= $a^{n}b^{n}c^{n}$ | $n \geq 0$ Consider the following Statement: A PDA can accept the given language. As we can insert 2 a’s for every entry of a, and pop one ‘a’ for every b and after all b’s, pop one ‘a’ for every entry of ‘c’ So the above language is a CFL. Prove the above statement WRONG
Consider the following Language:L= $a^{n}b^{n}c^{n}$ | $n \geq 0$Consider the following Statement:A PDA can accept the given language. As we can insert 2 a’s for every ...
Souvik33
411
views
Souvik33
asked
Nov 26, 2022
Theory of Computation
pushdown-automata
theory-of-computation
context-free-language
+
–
2
votes
1
answer
38
CFL | TOC | Ace Academy Test Series
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
If L and $L^{c}$ both are CFL, the L must be DCFL a. TRUE b.FALSE
Souvik33
302
views
Souvik33
asked
Nov 23, 2022
Theory of Computation
theory-of-computation
context-free-language
self-doubt
dcfl
+
–
1
votes
1
answer
39
Theory of Computation
State True or False. All Linear languages are non-deterministic context free language.
State True or False. All Linear languages are non-deterministic context free language.
Overflow04
726
views
Overflow04
asked
Oct 28, 2022
Theory of Computation
theory-of-computation
self-doubt
context-free-language
+
–
0
votes
1
answer
40
Context Free Grammar, Theory of computation
how shall we prove or verify that { ( a^n!) , n>=0 } is not a CFG. I tried applying pumping lemma but got stuck.
how shall we prove or verify that { ( a^n!) , n>=0 } is not a CFG.I tried applying pumping lemma but got stuck.
rd8794
344
views
rd8794
asked
Oct 15, 2022
Theory of Computation
context-free-language
theory-of-computation
+
–
0
votes
0
answers
41
Best Open Video Playlist for Regular and Context-free Languages Topic | Theory of compuation
Please list out the best free available video playlist for Regular and Context-free Languages Topic from Theory of compuation as an answer here (only one playlist per answer). We'll then select the best ... are more likely to be selected as best. For the full list of selected videos please see here
Please list out the best free available video playlist for Regular and Context-free Languages Topic from Theory of compuation as an answer here (only one playlist per an...
makhdoom ghaya
178
views
makhdoom ghaya
asked
Aug 18, 2022
Others
missing-videos
free-videos
video-links
go-classroom
regular-language
context-free-language
+
–
0
votes
1
answer
42
Context free language
Why the complement of a CFL is CSL?
Why the complement of a CFL is CSL?
swami_9
525
views
swami_9
asked
Jul 16, 2022
Theory of Computation
theory-of-computation
self-doubt
context-free-language
+
–
0
votes
1
answer
43
Dcfl union Regular not always dcfl?
$L=\{a^mb^n\mid m≠n\}∪{(a+b)^∗b(b+a)^*a(a+b)^∗}$ $\implies L = \;\{a^mb^n\mid m<n\} \cup \{a^mb^n\mid m>n\} \cup (a+b)^*b(a+b)^*a(a+b)^*$ It is DCFL ∪ Regular, hence it should be DCFL, but not able to design DPDA, always it designed as NPDA. Can anybody make a DPDA for $L$?
$L=\{a^mb^n\mid m≠n\}∪{(a+b)^∗b(b+a)^*a(a+b)^∗}$$\implies L = \;\{a^mb^n\mid m<n\} \cup \{a^mb^n\mid m>n\} \cup (a+b)^*b(a+b)^*a(a+b)^*$ It is DCFL ∪ Regular, ...
juuniversity
338
views
juuniversity
asked
Jun 22, 2022
Theory of Computation
dcfl
context-free-language
theory-of-computation
+
–
1
votes
1
answer
44
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b} if yes then why please explain
identify language is regular or not L={wcw^r | w,c belongs to E*} E={a,b}if yes then why please explain
sachin_27
1.3k
views
sachin_27
asked
Jun 1, 2022
Theory of Computation
theory-of-computation
regular-language
pumping-lemma
context-free-language
+
–
Page:
« prev
1
2
3
4
5
6
7
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register