Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
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$ ?
jaisyking
asked
in
Theory of Computation
Jan 12, 2023
by
jaisyking
192
views
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
1
vote
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}
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
303
views
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
1
vote
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 ?
ggwon
asked
in
Theory of Computation
Dec 29, 2022
by
ggwon
707
views
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
h4kr
asked
in
Theory of Computation
Dec 23, 2022
by
h4kr
282
views
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?
Sunnidhya Roy
asked
in
Theory of Computation
Dec 12, 2022
by
Sunnidhya Roy
610
views
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.
moe12leb
asked
in
Theory of Computation
Dec 3, 2022
by
moe12leb
329
views
theory-of-computation
context-free-language
1
vote
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
Souvik33
asked
in
Theory of Computation
Nov 26, 2022
by
Souvik33
423
views
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
Souvik33
asked
in
Theory of Computation
Nov 23, 2022
by
Souvik33
315
views
theory-of-computation
context-free-language
self-doubt
dcfl
1
vote
1
answer
39
Theory of Computation
State True or False. All Linear languages are non-deterministic context free language.
Overflow04
asked
in
Theory of Computation
Oct 28, 2022
by
Overflow04
809
views
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.
rd8794
asked
in
Theory of Computation
Oct 15, 2022
by
rd8794
357
views
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
makhdoom ghaya
asked
in
Others
Aug 18, 2022
by
makhdoom ghaya
189
views
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?
swami_9
asked
in
Theory of Computation
Jul 16, 2022
by
swami_9
537
views
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$?
juuniversity
asked
in
Theory of Computation
Jun 22, 2022
by
juuniversity
350
views
dcfl
context-free-language
theory-of-computation
1
vote
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
sachin_27
asked
in
Theory of Computation
Jun 1, 2022
by
sachin_27
1.3k
views
theory-of-computation
regular-language
pumping-lemma
context-free-language
Page:
« prev
1
2
3
4
5
6
7
...
21
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged context-free-language
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...