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
1
#toc
Çșȇ ʛấẗẻ
asked
in
Theory of Computation
Feb 24
by
Çșȇ ʛấẗẻ
65
views
theory-of-computation
finite-automata
regular-expression
regular-language
context-free-language
6
votes
1
answer
2
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 23
Which of the following statements is/are false? If a context-free grammar $\mathrm{G}$ is in Chomsky's normal form, then $\mathrm{G}$ is not ambiguous. For every number $n$, the language $\text{L}_n=\left\{0^n 1^n\right\}$ is ... 's a $10$-state NFA that accepts $\text{L}$ then there's a $100$-state DFA that accepts $\mathrm{L}$.
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
567
views
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
context-free-language
multiple-selects
1-mark
7
votes
1
answer
3
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 56
For a string $x=x_1 \cdots x_n \in \Sigma^*$, where $\Sigma$ is any alphabet and $x_1, \ldots, x_n \in \Sigma$, we write $x^{\uparrow m}=x^m$ (that is, the usual power of strings) and $x^{\downarrow m}=x_1^m \cdots x_n^m$. For empty ... $\left\{(a b c)^{\downarrow n} \mid n \geq 0\right\}$
GO Classes
asked
in
Theory of Computation
Jan 28
by
GO Classes
424
views
goclasses2024-mockgate-13
goclasses
numerical-answers
theory-of-computation
context-free-language
multiple-selects
2-marks
2
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 42
Consider the following context-free language: $L_1=\left\{a^m b^n c^n \mid n, m \geq 0\right\}$. Which of the following choices of language $L_2$ is context-free and ensures that $L_1 \cap L_2$ ... and $\left.m \geq 0\right\}$ $L_2=\left\{a^k b^{2 k} c^{2 k} \mid k \geq 0\right\}$
GO Classes
asked
in
Theory of Computation
Jan 21
by
GO Classes
472
views
goclasses2024-mockgate-12
goclasses
theory-of-computation
context-free-language
multiple-selects
2-marks
1
vote
1
answer
5
Is it DCFL or CFL?
If it’s DCFL then also construct the DPDA ?
vedantk
asked
in
Theory of Computation
Jan 10
by
vedantk
128
views
theory-of-computation
context-free-language
dcfl
identify-class-language
pushdown-automata
2
votes
1
answer
6
ISRO 2024
Which f the following statements is FALSE? The intersection of a regular language and a context-free language is context=free The intersection of a regular language and context-free language is regular The union of two context-free languages is context-free The union of two regular languages is regular
Ramayya
asked
in
Theory of Computation
Jan 7
by
Ramayya
152
views
isro-2024
theory-of-computation
context-free-language
regular-language
0
votes
0
answers
7
Can
Can $\Sigma^{*}$ be called DCFL? If yes, what would the state transition diagram of its PDA look like?
raj_uddeshya157
asked
in
Theory of Computation
Dec 27, 2023
by
raj_uddeshya157
64
views
theory-of-computation
gate-preparation
dcfl
dpda
npda
context-free-language
0
votes
1
answer
8
Micheal Sipser 3rd Edition, Problem 2.36
Is the following language context free? $L=\left \{ a^ib^j\:|\: i\neq j\:and\:2i\neq j \right \}$
rexritz
asked
in
Theory of Computation
Dec 16, 2023
by
rexritz
143
views
theory-of-computation
context-free-language
3
votes
2
answers
9
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
asked
in
Theory of Computation
Oct 25, 2023
by
Jiten008
333
views
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
1
vote
2
answers
10
Unacademy Compiler Design Workbook
Consider the following statements: (A) LL (k) grammars have one to one correspondence with DCFLs. (B) LR (k) grammars have one to one correspondence with CFLs. A is true but B is false A is false but B is true Both are False Both are True
lovish_bhatia
asked
in
Compiler Design
Sep 12, 2023
by
lovish_bhatia
341
views
compiler-design
syntax-directed-translation
lexical-analysis
context-free-grammar
context-free-language
1
vote
1
answer
11
Self Doubt from GoClasses Test Series
If L= { a^p | where p is any prime number }, then what is:- i) L+ ii) L* iii)L^3
Swarnava Bose
asked
in
Theory of Computation
Aug 26, 2023
by
Swarnava Bose
244
views
theory-of-computation
regular-language
context-free-language
0
votes
1
answer
12
General Doubt
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
Shaina Singh
asked
in
Theory of Computation
Jul 31, 2023
by
Shaina Singh
205
views
pushdown-automata
context-free-language
1
vote
1
answer
13
PDA,DCFL and CFL
Sourin Kundu
asked
in
Theory of Computation
Jul 4, 2023
by
Sourin Kundu
221
views
theory-of-computation
npda
dpda
context-free-language
0
votes
1
answer
14
Theory of Computation
gateexplore
asked
in
Theory of Computation
Jul 2, 2023
by
gateexplore
150
views
context-free-language
theory-of-computation
self-doubt
0
votes
1
answer
15
Theory of Computation
Find a Greibach normal form grammar equivalent to the following CFG. S →ASB/ AB A→ a B → b
gateexplore
asked
in
Theory of Computation
Jun 23, 2023
by
gateexplore
310
views
theory-of-computation
context-free-language
gnf
1
vote
1
answer
16
toc
$a^{p}b^{p}a^{p} where p>=0$ can i write this lang. as cfl when a come push in to the stack when b skip all b’s again when a pop all the a from the stack …..
jugnu1337
asked
in
Theory of Computation
Apr 17, 2023
by
jugnu1337
343
views
theory-of-computation
context-free-language
0
votes
1
answer
17
Theory of computation
Manukumr
asked
in
Theory of Computation
Apr 9, 2023
by
Manukumr
222
views
theory-of-computation
context-free-language
1
vote
1
answer
18
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, 2023
by
practicalmetal
349
views
context-free-language
theory-of-computation
ace-test-series
0
votes
1
answer
19
Context Free Languages
Is the following language CFL : { ww | w in (a+b)* and |w| <1000 }
practicalmetal
asked
in
Theory of Computation
Mar 21, 2023
by
practicalmetal
513
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
0
votes
1
answer
20
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, 2023
by
practicalmetal
480
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
0
votes
0
answers
21
#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, 2023
by
amit166
347
views
theory-of-computation
regular-language
context-free-language
0
votes
2
answers
22
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, 2023
by
moe12leb
245
views
theory-of-computation
context-free-language
context-free-grammar
Page:
1
2
3
4
5
6
...
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged context-free-language
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation