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
1
answer
1
Context Free Language
The complement of the languages: i) {ww | w in (0+1)*} ii) {$a^n b^nc^n$ | n>1} are a) Context Free b) Not Context Free c)are DCFL’s d)None
practicalmetal
asked
in
Theory of Computation
Mar 21
by
practicalmetal
65
views
context-free-language
theory-of-computation
ace-test-series
0
votes
1
answer
2
Context Free Languages
Is the following language CFL : { ww | w in (a+b)* and |w| <1000 }
practicalmetal
asked
in
Theory of Computation
Mar 21
by
practicalmetal
67
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
0
votes
1
answer
3
Context Free Languages
Is the following language context free: The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.
practicalmetal
asked
in
Theory of Computation
Mar 16
by
practicalmetal
87
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
0
votes
0
answers
4
#TIFR
Consider the language $L = \{a^i \$ a^j \$ b^k \$ | k ⩽ max(i, j), i, j, k ≥ 0\}$ over the alphabet $\sum = \{a, b, \$ \}$. The complement of the language L, that is, $\sum^* - \text{ L}$ is denoted by $L'$. Which of the following is ... d) $L$ is a context-free language and $L'$ is not a context-free language. (e) Neither is $L$ a context-free language nor is $L'$ a context-free language.
amit166
asked
in
Theory of Computation
Feb 13
by
amit166
86
views
theory-of-computation
regular-language
context-free-language
0
votes
2
answers
5
context free grammar
what is the langauge generated by this grammar ? S-->aS | aSbS | ε what is the language
moe12leb
asked
in
Theory of Computation
Jan 21
by
moe12leb
80
views
theory-of-computation
context-free-language
context-free-grammar
0
votes
0
answers
6
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
by
jaisyking
45
views
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
0
votes
1
answer
7
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
82
views
theory-of-computation
regular-language
pushdown-automata
context-free-language
minimal-state-automata
1
vote
2
answers
8
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
150
views
dcfl
context-free-language
theory-of-computation
identify-class-language
2
votes
0
answers
9
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
83
views
theory-of-computation
context-free-language
context-sensitive
pushdown-automata
0
votes
1
answer
10
#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
136
views
theory-of-computation
dcfl
pumping-lemma
context-free-language
0
votes
0
answers
11
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
101
views
theory-of-computation
context-free-language
1
vote
1
answer
12
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
166
views
pushdown-automata
theory-of-computation
context-free-language
2
votes
1
answer
13
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
103
views
theory-of-computation
context-free-language
self-doubt
dcfl
1
vote
1
answer
14
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
196
views
theory-of-computation
self-doubt
context-free-language
0
votes
1
answer
15
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
126
views
context-free-language
theory-of-computation
0
votes
0
answers
16
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
49
views
missing-videos
free-videos
video-links
go-classroom
regular-language
context-free-language
0
votes
1
answer
17
Context free language
Why the complement of a CFL is CSL?
swami_9
asked
in
Theory of Computation
Jul 16, 2022
by
swami_9
250
views
theory-of-computation
self-doubt
context-free-language
Page:
1
2
3
4
5
6
...
20
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Central Pollution Control Board CPCB Various Post Recruitment 2023
MP Rajya Sahkari Apex Bank Various Post Recruitment 2023
NITIE MUMBAI throgh GATE
PGCIL recruitment 2023 – Apply Online For 138 Posts through GATE
Admission guidance for GATE CSE 2023
Subjects
All categories
General Aptitude
(2.6k)
Engineering Mathematics
(9.4k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(655)
Exam Queries
(848)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(866)
Recent questions tagged context-free-language
Recent Blog Comments
Please upload updated previous year question...
The last hardcopy that was made was for GATE 2022...
overall only 3 post .no post for gen male
for gen GS in the range of 720-750 approx.
can we get 2023 hark copy from amazon?