Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged contextfreelanguages
0
votes
0
answers
TOC Ace test series
asked
Jan 19
in
Theory of Computation
by
Chirag Shilwant
(
179
points)

5
views
aceacademytestseries
theoryofcomputation
contextfreelanguages
0
votes
1
answer
ace test series toc cfl rel
Q.
asked
Jan 11
in
Theory of Computation
by
Rahul Burman
(
21
points)

19
views
theoryofcomputation
aceacademytestseries
contextfreelanguages
recursiveenumurablelanguage
0
votes
1
answer
Class of given language
Is the language $L = \{a^m b^n  m +n = p \}$ a CFL? Nothing is mentioned in the question, so I just assumed that m,n,p >= 0.
asked
Jan 7
in
Theory of Computation
by
goxul
(
373
points)

40
views
theoryofcomputation
contextfreelanguages
0
votes
0
answers
MADE EASY TEST SERIES CFL
Which of the following languages is CFL? (a) ${{a^{m}b^{n}c^{n}  m != n}}$ (b) ${a^{m}b^{n}c^{k}  if (m==n) then (n!=k) }$ (C) ${a^{m}b^{n}c^{k}  (m>n) or (n<k) }$ (d) None of the above
asked
Jan 7
in
Theory of Computation
by
tamaldeepmaity
(
17
points)

37
views
madeeasytestseries
theoryofcomputation
contextfreelanguages
0
votes
0
answers
MADE EASY fyll length test series
If the given language $L:\{(aa)^n (bb)^m (aa)^nm,n>=0\}$ & homomorphic function $h(0)=aa$ $h(1)=bb$ $h(2)=aa$ Then $h^{1}(L)$ will be $\{0^n 1^m 2^nm,n>=0\}$ $\{2^n 1^m 0^n m,n>=0\}$ $\{0^n 1^n 0^nm,n>=0\}$ none of the above Ans is D
asked
Dec 30, 2019
in
Theory of Computation
by
SHARMISTHA CHOUDHURY
(
7
points)

31
views
theoryofcomputation
contextfreelanguages
0
votes
1
answer
MadeEasy FULL SYLLABUS TEST1 (BASIC LEVEL) GATE 2020 Q51
asked
Dec 29, 2019
in
Theory of Computation
by
DukeThunders
(
415
points)

62
views
theoryofcomputation
contextfreelanguages
0
votes
0
answers
CFL and Regular language
If L is not contextfree and F is finite, then L \ F is not contextfree. True or False? If true, how would you prove it?
asked
Dec 21, 2019
in
Theory of Computation
by
goxul
(
373
points)

15
views
theoryofcomputation
contextfreelanguages
0
votes
0
answers
Why the name Context Free and Context Sensitive?
Why do we call CFG as Context Free and CSL as Context Sensitive? I am searching this since a long time but could not find an answer.
asked
Dec 21, 2019
in
Theory of Computation
by
AkashChandraGupta
(
6
points)

8
views
theoryofcomputation
contextfreelanguages
contextsensitivelanguages
#selfdoubt
0
votes
0
answers
MOCK TEST ACE TOC
Consider the following questions over $\sum = \begin{Bmatrix} a,b \end{Bmatrix}$ $L_{1} = \begin{Bmatrix} ww  w \in \begin{Bmatrix} a,b \end{Bmatrix}* \end{Bmatrix}$ $L_{2}$ = Complement of $L_{1}$ $L_{3} = L_{1} \bigcup L_{2}$ Which of the above languages is/are Recursively Enumerable but not Context Free Language?
asked
Dec 16, 2019
in
Theory of Computation
by
tamaldeepmaity
(
17
points)

19
views
theoryofcomputation
contextfreelanguages
recursively
0
votes
0
answers
#grammar context free
consider the following contextfree language L:{
[email protected]
$^{R}$ is substing for x,where w,x$\epsilon (a+b)^{\ast }$} . which of follwoing CFG will reprsent above language : A) $S\rightarrow QP$ $P\rightarrow aPabQb@Q$ $Q\rightarrow aQbQ\epsilon$ B) $S\rightarrow PQ$ $P\rightarrow aPabQb@Q$ $Q\rightarrow aQbQ\epsilon$ C) both a and b D) none of these
asked
Nov 28, 2019
in
Theory of Computation
by
amit166
(
138
points)

10
views
theoryofcomputation
contextfreelanguages
0
votes
0
answers
Testbook Test SeriesTOC
$\\ L_{1}= (0^m1^m0^n  m,n>0) \ \ \ \ \ L_{2}=(0^m1^n0^n m,n>0)\\ L_{1}\cup L_{2} \ ?\\ \\ 1. Dcfl\\ 2. Cfl\\ 3.Unambiguous\\ 4.Inherently \ ambiguous$ Answer given as 2 and 4 and I am facing difficulty to understand the 4th option. Please if any idea to anyone, do tell.
asked
Oct 2, 2019
in
Theory of Computation
by
Kushagra गुप्ता
(
176
points)

62
views
theoryofcomputation
contextfreelanguages
dcfl
testseries
0
votes
2
answers
Identify the class of the language
L = {PQ  P,Q $\in (a,b)^{*}$ and $n_{a}(P) = n_{b}(Q)$} The language is – DCFL but not Regular CSL but not CFL CFL but not DCFL Regular
asked
Sep 5, 2019
in
Theory of Computation
by
MRINMOY_HALDER
(
37
points)

34
views
theoryofcomputation
#toc
#testseries
contextfreelanguages
regularlanguages
+1
vote
1
answer
a language is CFL or not
$L_{1} = { 0^{m}1^{n} n\leq m\leq 2n}$ why this is CFL ????
asked
Aug 28, 2019
in
Theory of Computation
by
MRINMOY_HALDER
(
37
points)

24
views
theoryofcomputation
contextfreelanguages
#toc
0
votes
3
answers
CFL or not ( test series qsn)
This language is CFL or not – $\Sigma = \{ a,b \} $ and $L = \{ x \# y\ \ x,y \in \Sigma^*\ , \#\ is \ a \ constant\ and\ x \neq y \}$ please give the reason also
asked
Aug 28, 2019
in
Theory of Computation
by
MRINMOY_HALDER
(
37
points)

200
views
theoryofcomputation
contextfreelanguages
#toc
0
votes
0
answers
It is CFL or not
It is CFL or not $\{wa^n w^r \ w\ \in (a+b)^*, n>=0 \}$
asked
Aug 21, 2019
in
Theory of Computation
by
Sandeep Verma
(
13
points)

25
views
theoryofcomputation
contextfreelanguages
+1
vote
1
answer
The language is context free or not
consider this language: L={(a^n b^n)^2 :n>=0} Is this context free?
asked
Aug 20, 2019
in
Theory of Computation
by
Doraemon
(
91
points)

32
views
contextfreelanguages
theoryofcomputation
0
votes
1
answer
Context free language
Is the given language CFL or not? Σ*L={a^n b^n a^n n>=1}
asked
Aug 14, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

21
views
#toc
cfg
contextfreelanguages
0
votes
1
answer
DCFG Self Doubt
if $a^nb^n$ is DCFL the is $(a^nb^n)$* DCFL?
asked
Aug 9, 2019
in
Theory of Computation
by
aditi19
(
55
points)

25
views
#toc
contextfreelanguages
contextfreelanguage
kleeneclosure
+2
votes
4
answers
fssai IT assistant exam 2019 Q15
What is the maximum number of language a contextfree Grammar (CFG) can generate? Three Two One Infinite
asked
Jul 31, 2019
in
Compiler Design
by
akshat sinha
(
12
points)

157
views
cfg
compiler_design
contextfreelanguages
compiler
grammar
–1
vote
1
answer
Ambiguity related to Context free grammar
asked
Jul 28, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

31
views
contextfreelanguages
grammar
theoryofcomputation
ambiguity
0
votes
1
answer
Context free grammar
asked
Jul 25, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

28
views
madeeasyworkbook
contextfreelanguages
grammar
theoryofcomputation
0
votes
2
answers
Self Doubt: Why is "intersection with regular languages" closed for context free languages ?
asked
Jul 20, 2019
in
Theory of Computation
by
commenter commenter
(
31
points)

15
views
theoryofcomputation
contextfreelanguages
regular
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Feb 2020
shashin
363 Points
Shaik Masthan
79 Points
SuvasishDutta
39 Points
srestha
33 Points
Mk Utkarsh
32 Points
neeraj_bhatt
31 Points
!KARAN
30 Points
Debapaul
23 Points
Pratyush Priyam Kuan
18 Points
kalra05
18 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,314
questions
1,581
answers
10,271
comments
89,904
users