The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged dcfl
0
votes
1
answer
1
ACE Academy: Recognition of CFG
$L1 =\left \{ a^{m} b^{n} c^{p}  \left ( m \geq n \right )\text{or} \left ( n = p \right ) \right \}$ $L2 =\left \{ a^{m} b^{n} c^{p}  \left ( m \geq n \right )\text{and} \left ( n = p \right ) \right \}$ $(a)$ Both are NCFL’s $(b)$ L1 is DCFL and L2 is NCFL $(c)$ L1 is NCFL and L2 is not contextfree $(d)$ Both are not contextfree
asked
May 23
in
Theory of Computation
by
Hirak
Active
(
3.5k
points)

74
views
cfg
contextfreelanguage
dcfl
0
votes
0
answers
2
Made Easy Test Series : Doubt on Automata
$\left \{ a^{n}.b^{n+k}\mid n\geq 0,k\geq 1 \right \}\cup \left \{ a^{n+k}.b^{n}\mid n\geq 0,k\geq 3 \right \}$ is DCFL Is it true? As we know union of two DCFL cannot be DCFL
asked
Apr 4
in
Theory of Computation
by
srestha
Veteran
(
117k
points)

59
views
madeeasytestseries
theoryofcomputation
dcfl
0
votes
0
answers
3
RL and DCFL
the answer is given that the statement 2 is correct? But how… even if we create a DCFL by final state condition like : q(b,z0 z0)→ final state ,q(null,az0) → final state [Thats what was mentioned in the video solution] it will accept the string aab
asked
Jan 22
in
Theory of Computation
by
Nandkishor3939
Active
(
1.3k
points)

26
views
theoryofcomputation
regularlanguages
dcfl
+1
vote
0
answers
4
DCFL or CFL?
Given that: { A^m B^n C^k/ if (k=even) then m=n} { A^m B^n C^k/ if (n=even) then m=k} Which of the above languages are DCFL? According to me it is CFL as we have to first count k and then compare other inputs.. same for second language ... is both are DCFL? it is only possible if skip path is exists here? does it exist for DCFLs? so confused please guide me? if given answer is correct?
asked
Jan 3
in
Theory of Computation
by
S Ram
Active
(
1.7k
points)

165
views
theoryofcomputation
dcfl
contextfreelanguage
0
votes
0
answers
5
context free grammer
consider following grammer S → aSb / aSbb / aSbbb / ….. is language generated by above grammer is DCFL?
asked
Dec 24, 2018
in
Theory of Computation
by
Rahul_Rathod_
(
425
points)

69
views
grammar
contextfreelanguage
dcfl
cfg
0
votes
0
answers
6
Draw PDA for this
L = {a^m b^n c^k=m+n }  m >= 0 and n >= 0  Please draw PDA for this Language!
asked
Dec 12, 2018
in
Theory of Computation
by
Guilherme Zanini Mor
(
5
points)

93
views
theoryofcomputation
pushdownautomata
contextfreelanguage
dcfl
+1
vote
1
answer
7
Language DCFL?
$L_{1}=\left \{ 0^{m}.1^{n}.2^{m}.3^{n} \right n,m>0\}$ $L_{2}=\left \{ a^{i}.b^{j}.c^{k}.d^{l} \right i+k=j+l\}$ which one DCFL? Refrence :https://gateoverflow.in/15327/contextfreeornot I think both not DCFL, but need valid reason for it
asked
Nov 26, 2018
in
Theory of Computation
by
srestha
Veteran
(
117k
points)

105
views
theoryofcomputation
dcfl
contextfreelanguages
0
votes
1
answer
8
DCFL_
state true /false 1) for every DCFL there exist at least one unambiguous grammar
asked
Nov 22, 2018
in
Theory of Computation
by
Gurdeep Saini
Boss
(
10.2k
points)

63
views
theoryofcomputation
grammar
dcfl
0
votes
0
answers
9
own doubt
can we say that every regular language is a DCFL?
asked
Oct 27, 2018
in
Theory of Computation
by
sudharshan
(
289
points)

46
views
theoryofcomputation
dcfl
regularlanguages
0
votes
0
answers
10
Concatenation of DCFLs
L1={an bn  n>=0} L2={bn cn  n>=0} What is L1.L2 ? Is it an b2n cn ?
asked
Oct 13, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

50
views
theoryofcomputation
dcfl
contextfreelanguages
identifyclasslanguage
0
votes
0
answers
11
DCFL Language
Consider the following languages : L1: {a bn a2n  n ≥ 0 } L2: { a a bn a3n  n ≥ 0 } Which of the following is true ? A. L1 U L2 is regular B. L1 U L2 is DCFL C. L1 intersection L2 is non regular D. L1 U L2 is not CFL
asked
Sep 11, 2018
in
Theory of Computation
by
Na462
Loyal
(
6.8k
points)

61
views
theoryofcomputation
dcfl
contextfreelanguages
0
votes
0
answers
12
test series
L1 = {a^mb^nc^p  m ≥ n or n = p} L2 = {a^mb^nc^p  m ≥ n and n = p} (a) Both are NCFL’s (b) L1 is DCFL and L2 is NCFL (c) L1 is NCFL and L2 is not contextfree (d) Both are not contextfree Solution: Option (c) how it is possible plz explain indetail
asked
Sep 3, 2018
in
Theory of Computation
by
navya n
(
365
points)

53
views
testseries
dcfl
0
votes
0
answers
13
Curiousity
In an intersection between a regular language and a DCFL, we always tend to promote regular language to DCFL and say that the result will be intersection between DCFL and DCFL but since DCFLs are not closed under intersection we say the result will be a CFL. But ... which is not DCFL Can you write a language which is an intersection between a DCFL and a regular language but not a DCFL.
asked
Aug 12, 2018
in
Theory of Computation
by
Vikas Verma
Active
(
3.3k
points)

81
views
theoryofcomputation
dcfl
regularlanguages
0
votes
0
answers
14
Regular language
Whether the language $L=\left \{ a^{n}b^{l}a^{k}:n+l+k> 5 \right \}$ is regular or not???
asked
Aug 3, 2018
in
Theory of Computation
by
saumya mishra
Junior
(
953
points)

50
views
theoryofcomputation
dcfl
+3
votes
1
answer
15
DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?
asked
Jun 22, 2018
in
Theory of Computation
by
srestha
Veteran
(
117k
points)

288
views
theoryofcomputation
dcfl
contextfreelanguages
pushdownautomata
+1
vote
1
answer
16
ISRO CS 17
Consider the following statements about the context free grammar G = {S>SS , S>ab , S>ba , S>^} I. G is ambiguous II. G produces all strings with equal number of a's and b's III. G can be accepted by a deterministic PDA. Which combination below expresses all ... ? A) I only B) I and III C) II and II D) All I,II,III In a answer key shown answer D but II is not right.
asked
Jun 13, 2018
in
Theory of Computation
by
Nikhil Patil
(
497
points)

138
views
userisro2017
usermod
theoryofcomputation
dcfl
dpda
0
votes
0
answers
17
regular language and CFL
$L=\left \{ a^{n}b^{n}c^{n}d^{n}  n<10^{10} \right \}$ I know this language is regular language so it is DCFL AND CFL also but how can we implenment this language with DCFL with stack because till we reach c there ... language can be implemented using FA We can have these many states to compare how we will compare in stack explain the logic of this language with DCFL
asked
May 17, 2018
in
Theory of Computation
by
sanju77767
(
211
points)

127
views
theoryofcomputation
dcfl
+3
votes
2
answers
18
Concatenation: REG / REC / DCFL / CFL?
Let A is the language where no of 'a' is greater than no of 'b' and B is the language where no of 'b' is greater than no of ‘a’ the language A.B is ______________ a. Regular b. DCFL but not Regular c. CFL but not DCFL d. REC but not DCFL
asked
Jan 27, 2018
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
9.6k
points)

205
views
theoryofcomputation
regularexpressions
dcfl
contextfreelanguages
+2
votes
0
answers
19
Union of two DCFL is ?
Consider two languages LA and LB over Σ={a,b}. LA= {a^ib^ja^k  i,j,k ≥ 0 and j=i+k} LB= {b^ia^jb^k  i,j,k ≥ 0 and j=i+k} Then ( LA ∪ LB ) is : A DCFL but not regular B CFL but not DCFL C None of the above D CSL but not CFL
asked
Jan 19, 2018
in
Theory of Computation
by
sunil sarode
Active
(
1.2k
points)

254
views
theoryofcomputation
dcfl
contextfreelanguages
+1
vote
0
answers
20
DCFL01
What is DCFL U Regular ? Every Regular lang is DCFL , That means DCFL U DCFL = not DCFL ? since DCFL's are not closed under union
asked
Jan 19, 2018
in
Theory of Computation
by
Anjan
Active
(
1.3k
points)

46
views
theoryofcomputation
dcfl
+2
votes
0
answers
21
Intersection of two DCFLs
$ L_1\ =\ \{ \ a^mb^mb^na^n  m,n\ >\ 0\}\\ L_2\ =\ \{ \ a^mb^na^nb^m  m,n\ >\ 0\}$ Find $L_1 \cap L_2$
asked
Jan 18, 2018
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
9.6k
points)

124
views
theoryofcomputation
dcfl
+2
votes
0
answers
22
Self Doubt
Can Anyone please explain the difference between DCFL and NDCGL with 45 good and tricky,complex examples.
asked
Jan 13, 2018
in
Theory of Computation
by
ankit_thawal
Active
(
1.4k
points)

29
views
dcfl
+1
vote
3
answers
23
Is the following language CFL?
Not able to understand whether it is CFL or not due to the condition 'm>=481'.
asked
Dec 22, 2017
in
Theory of Computation
by
Ashish Sharma 3
(
337
points)

183
views
theoryofcomputation
contextfreelanguage
pushdownautomata
dcfl
contextfreelanguages
+1
vote
2
answers
24
DCFL or not??
$L1 = \bigl\{a^mb^nc^pd^q \mid m+q = n+p \bigr\}$ $L2 = \bigl\{a^mb^nc^pd^q \mid m+p = n+q \bigr\}$ 1. L1 is DCFL, L2 is not 2. L2 is DCFL, L1 is not 3. Both are not DCFL 4. Both are DCFL
asked
Dec 21, 2017
in
Theory of Computation
by
atul_21
Active
(
2.8k
points)

150
views
dcfl
pushdownautomata
contextfreelanguages
0
votes
0
answers
25
is it DCFL OR NOT?
asked
Dec 9, 2017
in
Theory of Computation
by
pranab ray
Junior
(
779
points)

80
views
theoryofcomputation
dcfl
0
votes
1
answer
26
DCFL or not
Consider the following languages: L1={abna2nn>=0} L2={aabna3nn>=0} Why L1UL2 is DCFL please explain?
asked
Dec 2, 2017
in
Theory of Computation
by
shivangi5
Active
(
1.1k
points)

188
views
theoryofcomputation
dcfl
contextfreelanguage
contextfreelanguages
+1
vote
2
answers
27
(DCFL U Reg) '
Hi Guys, What will be ${\left ( DCFL \cup Regular \right )} '$ ?
asked
Nov 11, 2017
in
Theory of Computation
by
Chhotu
Boss
(
13.2k
points)

145
views
dcfl
regularexpressions
+6
votes
1
answer
28
DCFL or NOT
Consider the follwoing Language L1= {0n1*0n  n>0} is DCFL or Not? L2= {0n1+0n  n>0} is DCFL or Not?
asked
Nov 4, 2017
in
Theory of Computation
by
Anu007
Boss
(
18.6k
points)

182
views
theoryofcomputation
dcfl
+4
votes
1
answer
29
TOC Test Series
Consider the languages (I) L1= {w#x , where w,x ∈ (0+1)* and # is a special character and w is a prefix of x } . (II) L2={w#x , where w,x ∈ (0+1)* and # is a special character and wR, is a prefix of x}. (III) L3={w#x , where w,x ∈ (0+1)* and # is a ... (II) and (III) is DCFL (I) and (IV) is recursive but not CFL. (I) is recursive , (II) is DCFL , (III) and (IV) are CFL but not DCFL
asked
Oct 14, 2017
in
Theory of Computation
by
sunil sarode
Active
(
1.2k
points)

127
views
theoryofcomputation
dcfl
recursiveandrecursivelyenumerablelanguages
+6
votes
1
answer
30
DCFL,AMBIGUITY
asked
Sep 26, 2017
in
Theory of Computation
by
junaid ahmad
Loyal
(
8.5k
points)

459
views
theoryofcomputation
dcfl
Page:
1
2
next »
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
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Follow @csegate
Recent questions tagged dcfl
Recent Blog Comments
@ankitgupta.1729 Thanks a lot ... :)
@Debapaul yeah, for part 1) gate...
No, I didn't enroll in any test series though got...
What region behind page not found in gate...
Sir can you please suggest some way like how can...
50,650
questions
56,228
answers
194,225
comments
95,688
users