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
32
votes
2
answers
601
GATE CSE 2014 Set 3 | Question: 36
Consider the following languages over the alphabet $\sum = \{0, 1, c\}$ $L_1 = \left\{0^n1^n\mid n \geq 0\right\}$ $L_2 = \left\{wcw^r \mid w \in \{0,1\}^*\right\}$ ... the string $w$. Which of these languages are deterministic Context-free languages? None of the languages Only $L_1$ Only $L_1$ and $L_2$ All the three languages
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
9.8k
views
gatecse-2014-set3
theory-of-computation
identify-class-language
context-free-language
normal
32
votes
3
answers
602
GATE CSE 2014 Set 3 | Question: 35
Which one of the following problems is undecidable? Deciding if a given context-free grammar is ambiguous. Deciding if a given string is generated by a given context-free grammar. Deciding if the language generated by a given context-free grammar is empty. Deciding if the language generated by a given context-free grammar is finite.
go_editor
asked
in
Theory of Computation
Sep 28, 2014
by
go_editor
8.7k
views
gatecse-2014-set3
theory-of-computation
context-free-language
decidability
normal
34
votes
2
answers
603
GATE CSE 1999 | Question: 7
Show that the language $L = \left\{ xcx \mid x \in \left\{0,1\right\}^* \text{ and }c\text{ is a terminal symbol}\right\}$ is not context free. $c$ is not $0$ or $1$.
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
5.1k
views
gate1999
theory-of-computation
context-free-language
normal
proof
20
votes
3
answers
604
GATE CSE 1999 | Question: 1.5
Context-free languages are closed under: Union, intersection Union, Kleene closure Intersection, complement Complement, Kleene closure
Kathleen
asked
in
Theory of Computation
Sep 23, 2014
by
Kathleen
7.4k
views
gate1999
theory-of-computation
context-free-language
easy
36
votes
5
answers
605
GATE CSE 2005 | Question: 57
Consider the languages: $L_1 = \left\{ww^R \mid w \in \{0, 1\}^* \right\}$ $L_2 = \left\{w\text{#}w^R \mid w \in \{0, 1\}^* \right\}$, where $\text{#}$ ... of the following is TRUE? $L_1$ is a deterministic CFL $L_2$ is a deterministic CFL $L_3$ is a CFL, but not a deterministic CFL $L_3$ is a deterministic CFL
Kathleen
asked
in
Theory of Computation
Sep 22, 2014
by
Kathleen
8.4k
views
gatecse-2005
theory-of-computation
context-free-language
easy
64
votes
4
answers
606
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
Rucha Shelke
asked
in
Compiler Design
Sep 18, 2014
by
Rucha Shelke
28.7k
views
gatecse-2006
compiler-design
context-free-language
normal
isro2016
51
votes
6
answers
607
GATE CSE 2006 | Question: 19
Let $L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$, $L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and $L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT context free? $L_1$ only $L_3$ only $L_1$ and $L_2$ $L_2$ and $L_3$
Rucha Shelke
asked
in
Theory of Computation
Sep 17, 2014
by
Rucha Shelke
15.2k
views
gatecse-2006
theory-of-computation
context-free-language
normal
64
votes
4
answers
608
GATE CSE 2003 | Question: 51
Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true? $G$ is not ambiguous There ... $L(G)$ We can find a deterministic finite state automaton that accepts $L(G)$
Kathleen
asked
in
Theory of Computation
Sep 17, 2014
by
Kathleen
17.5k
views
gatecse-2003
theory-of-computation
context-free-language
normal
30
votes
3
answers
609
GATE CSE 2001 | Question: 1.5
Which of the following statements is true? If a language is context free it can always be accepted by a deterministic push-down automaton The union of two context free languages is context free The intersection of two context free languages is a context free The complement of a context free language is a context free
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
13.8k
views
gatecse-2001
theory-of-computation
context-free-language
easy
27
votes
2
answers
610
GATE CSE 2000 | Question: 7
Construct as minimal finite state machine that accepts the language, over $\{0,1\}$, of all strings that contain neither the substring $00$ nor the substring $11$. Consider the grammar $S \to aSAb $ $S \to \epsilon $ $A \to bA $ $ A \to \epsilon $ where $S$ ... $i, j \geq 0$, where $i$ and $j$ satisfy some condition. What is the condition on the values of $i$ and $j$?
Kathleen
asked
in
Theory of Computation
Sep 14, 2014
by
Kathleen
4.6k
views
gatecse-2000
theory-of-computation
descriptive
regular-language
context-free-language
43
votes
4
answers
611
GATE CSE 1992 | Question: 02,xviii
If $G$ is a context free grammar and $w$ is a string of length $l$ in $L(G)$, how long is a derivation of $w$ in $G$, if $G$ is in Chomsky normal form? $2l$ $2l +1$ $2l -1$ $l$
Kathleen
asked
in
Theory of Computation
Sep 13, 2014
by
Kathleen
14.8k
views
gate1992
theory-of-computation
context-free-language
easy
23
votes
4
answers
612
GATE CSE 1992 | Question: 02,xix
Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
Kathleen
asked
in
Theory of Computation
Sep 13, 2014
by
Kathleen
4.7k
views
gate1992
context-free-language
theory-of-computation
normal
multiple-selects
5
votes
2
answers
613
Which of the following languages are CFL?
Which of the following languages are CFL? $L_1= \left \{ 0^n 1^m \mid n \leq m \leq 2n \right \} \\[1em] L_2 =\left \{ a^i b^j c^k \mid i=2j \text{ or } j=2k \right \}$
gatecse
asked
in
Theory of Computation
Sep 12, 2014
by
gatecse
1.9k
views
theory-of-computation
context-free-language
normal
Page:
« prev
1
...
16
17
18
19
20
21
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:...