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 identifyclasslanguage
How to solve?
0
votes
1
answer
1
Self doubt
$L=\{wxyww,x,y\in (a+b)^+ \}$ $L$ is ? Regular Deterministic CFL Nondeterministic CFL CSL
asked
Mar 28
in
Theory of Computation
by
Verma Ashish
Boss
(
11.1k
points)

39
views
theoryofcomputation
identifyclasslanguage
0
votes
2
answers
2
Virtual Gate Test Series: Theory Of Computation  Languages
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ is Regular Recursive but not context free Context Free but not regular None of the above
asked
Mar 24
in
Theory of Computation
by
aditi19
Active
(
5k
points)

109
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
0
votes
1
answer
3
Virtual Gate Test Series: Theory Of Computation  Languages
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy  x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? L is regular, but not contextfree. L is contextfree, but not regular. L is Σ*. None of these.
asked
Jan 26
in
Theory of Computation
by
jatin khachane 1
Loyal
(
7.2k
points)

82
views
theoryofcomputation
identifyclasslanguage
virtualgatetestseries
0
votes
1
answer
4
Class of language
Please suggest me in briefly for revision . How to we test regular,dcfl,cfl,recursive and recursive enumeranle. Eg say if we can find the pattern it's regular. Please help
asked
Jan 24
in
Theory of Computation
by
Mayankprakash
Junior
(
997
points)

32
views
theoryofcomputation
identifyclasslanguage
+1
vote
1
answer
5
Testbook Test Series: Theory of Computation  Identify Class Language
Consider the infinite twodimensional grid G={(m,n) m and n are integers} Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by 1. Starting at the origin (0,0), a ... the following statements is TRUE? i) L is Regular. ii) L is context free. iii) L complement is context free. Thanks!
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
91
points)

42
views
testbooktestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
6
MadeEasy Full Length Test 2019: Theory of Computation  Identify Class Languages
asked
Jan 15
in
Theory of Computation
by
MiNiPanda
Boss
(
22.8k
points)

206
views
identifyclasslanguage
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
votes
2
answers
7
MadeEasy Test Series: Theory Of Computation  Identify Class Language
$L = \left \{ x^{l}y^{m}z^{n}  \ l+m+n\ is\ divisible\ by\ 5\right \}$ Is it regular or CFL or CSL ?
asked
Jan 8
in
Theory of Computation
by
jatin khachane 1
Loyal
(
7.2k
points)

117
views
madeeasytestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
8
TOC languages
please tell me if i am wrong
asked
Jan 5
in
Theory of Computation
by
VIDYADHAR SHELKE 1
Active
(
1.2k
points)

12
views
identifyclasslanguage
+1
vote
1
answer
9
#TOC identify languages.
If all finite subsets of LL are regular, then LL is regular. If a proper subset of LL is not regular, then LL is not regular. Subsets of finite sets are always regular. Subsets of finite sets are always regular. Every subset of language is regular than L is regular.
asked
Dec 28, 2018
in
Theory of Computation
by
iarnav
Loyal
(
8.2k
points)

42
views
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
10
Zeal Test Series 2019: Theory of Computation  Identify Class Language
asked
Dec 21, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.6k
points)

52
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
+2
votes
2
answers
11
TIFR2019B10
Let the language $D$ be defined in the binary alphabet $\{0,1\}$ as follows: $D:= \{ w \in \{0,1\}^* \mid \text{ substrings 01 and 10 occur an equal number of times in w} \}$ For example , $101 \in D$ while $1010 \notin D$. Which of the ... ? $D$ is regular $D$ is contextfree but not regular $D$ is decidable but not contextfree $D$ is decidable but not in NP $D$ is undecidable
asked
Dec 18, 2018
in
Theory of Computation
by
Arjun
Veteran
(
423k
points)

252
views
tifr2019
theoryofcomputation
identifyclasslanguage
+2
votes
2
answers
12
Regular language
L={a^m b^n  mn=even} Is this language a regular language?
asked
Dec 12, 2018
in
Theory of Computation
by
AIkiran01
(
119
points)

236
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
identifyclasslanguage
0
votes
0
answers
13
VirtualGate CFL or Regular language Identification
For $\text{A, B} \subseteq \Sigma^*,$ define $A/B = \{x \in \Sigma^*  \exists y \in B , xy \in A \}$ If L is a CFL and R is regular, then L/R is Regular CFL but not regular Recursive but not CFL None of the above ... are not regular but they are CFL. Hence, $L/R$ is CFL but not Regular. Please advise me that am I thinking in correct way or not?
asked
Dec 8, 2018
in
Theory of Computation
by
!KARAN
Active
(
2.1k
points)

57
views
theoryofcomputation
identifyclasslanguage
+4
votes
1
answer
14
Zeal Test Series 2019: Theory of Computation  Identify Class Language
suppose we define max(L) = $ \{ \; x \;\; x \in L,(\;\forall y \in \Sigma ^*,(y\neq \lambda )\Rightarrow (xy\notin L)\;\;) \;\}$ let L$_1$ = $ \{ \;a^ib^jc^k\;\;k ≤i \;or\; k ≤j;where\; i,j,k ≥ 0 \;\}$ and L$_2$ ... CFL (c) max( L$_1$ ) is CFL but max( L$_2$ ) is not CFL. (d) max( L$_2$ ) is CFL but max( L$_1$ ) is not CFL.
asked
Nov 25, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.6k
points)

178
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
+2
votes
0
answers
15
Zeal Test Series 2019: Theory of Computation  Identify Class Language
in this question L2 is regular and in first statement what i got that it is DCFL.COMPLEMENT(DCFL).regular and in 2 one DCFLunion regular 3 i am not getting , what i want that can anyone explain the properties of regular with nonregular or anylanguage with regular for this question
asked
Nov 25, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.6k
points)

41
views
zeal
identifyclasslanguage
theoryofcomputation
zeal2019
+3
votes
1
answer
16
Zeal Test Series 2019: Theory of Computation  Identify Class Language
select the correct statement NonCFL is closed under reversal operation . L=$ \{ \;0^n1^m0^m: n+m \; mod \;6 =2 \} $ is CFL but not regular. if L is context free and R and S are regular ,then MAJORITY(L,R,S)={ w w is in atleast two of R,L,S } is also context free (a) only i (b) only I and II (c) Only II and III (d) All
asked
Nov 25, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.6k
points)

109
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
0
votes
1
answer
17
Testbook Test Series: Theory of Computation  Identify Class Language
Is L={1n0n0m  m+n>100} a regular language?
asked
Oct 30, 2018
in
Theory of Computation
by
CS.user
(
93
points)

114
views
testbooktestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
18
GateForum Test Series: Theory Of Computation  Identify Class Language
My answer is C but the answer provided is D.
asked
Oct 27, 2018
in
Theory of Computation
by
Gupta731
Active
(
4.7k
points)

38
views
gateforumtestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
19
TOC Self Doubt
If L1 is CFL and L2 is Regular L. $L1\cap L2 = L3$ Then L3 is CFL. Can L3 be regular also sometimes and if L3 is CFL and Regular also does it employs L1 is also Regular ??
asked
Oct 14, 2018
in
Theory of Computation
by
jatin khachane 1
Loyal
(
7.2k
points)

74
views
theoryofcomputation
regularlanguages
identifyclasslanguage
0
votes
0
answers
20
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
+1
vote
0
answers
21
language class
L = { (ak.bp)p.an.bn  k,p,n>=0 } is this regular or cfl?
asked
Oct 3, 2018
in
Theory of Computation
by
Lone Wolf
Active
(
1.5k
points)

37
views
identifyclasslanguage
+2
votes
2
answers
22
Regular Language
Is the given Grammer represent a regular language ? S>AaB A>aC  epsilon B>aB  bB  epsilon C>aCb  epsilon
asked
Sep 13, 2018
in
Theory of Computation
by
Na462
Loyal
(
6.8k
points)

126
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
identifyclasslanguage
+1
vote
1
answer
23
Regular language identification
Is Language L = {0(n+m) 1(k+l)  m = l, and m,n,k,l ≥ 1 } a regular language ? explain
asked
Sep 11, 2018
in
Theory of Computation
by
Na462
Loyal
(
6.8k
points)

170
views
theoryofcomputation
identifyclasslanguage
regularlanguages
regularexpressions
0
votes
2
answers
24
Testbook Test Series: Theory of Computation  Identify Class Language
Doubt 1: according to me L1 should be subset of L2. But answer is d) L1,L2,L3 are incomparable. Please explain this question to me Doubt 2: which type of language is L4?
asked
Aug 12, 2018
in
Theory of Computation
by
Ananya Jaiswal 1
Active
(
2.2k
points)

68
views
testbooktestseries
theoryofcomputation
identifyclasslanguage
+1
vote
2
answers
25
Zeal Test Series 2019: Theory of Computation  Identify Class Language
Which of the following is CFL ? a) L1 is CFL b)L1 is CFL but L2 is not CFL c)Both L1 and L2 are CFL d) None
asked
Aug 3, 2018
in
Theory of Computation
by
Prince Sindhiya
Loyal
(
5.6k
points)

125
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
0
votes
1
answer
26
Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}n<m,n,m\geq 1 \right \}$
asked
May 24, 2018
in
Theory of Computation
by
srestha
Veteran
(
117k
points)

185
views
theoryofcomputation
regularlanguages
identifyclasslanguage
+2
votes
1
answer
27
Prove that language is CFL
$ L= \{ w1 w2  w1,w2 ∈Σ^{+} ,w1!=w2 \} $ How can i prove that it is CFL?
asked
Apr 10, 2018
in
Theory of Computation
by
rahul sharma 5
Boss
(
25.2k
points)

132
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
28
Language Identification
Under Which class of language , Set of binary strings represents Fibonacci Sequence over input alphabet {0,1} ? I think either it is Context Sensitive Language or Recursive Language. Can anyone please help me ?
asked
Feb 25, 2018
in
Theory of Computation
by
ankitgupta.1729
Boss
(
15.9k
points)

53
views
theoryofcomputation
identifyclasslanguage
+22
votes
10
answers
29
GATE201835
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are contextfree? I and IV only I and II only II and III only II and IV only
asked
Feb 14, 2018
in
Theory of Computation
by
gatecse
Boss
(
16.6k
points)

4.7k
views
gate2018
theoryofcomputation
identifyclasslanguage
contextfreelanguage
normal
+4
votes
0
answers
30
Testbook Test Series: Theory of Computation  Identify Class Language
asked
Jan 30, 2018
in
Theory of Computation
by
Shailin Shah
(
71
points)

132
views
testbooktestseries
identifyclasslanguage
theoryofcomputation
Page:
1
2
3
4
5
6
7
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 identifyclasslanguage
Recent Blog Comments
still it's usefull for practice purpose and...
@Satbir Its a valuable info..Thanks
It is the 2019 question paper given as a mock...
Favorite is not working for blogs.. In favorites...
Favourite option does work. But list options...
50,650
questions
56,186
answers
193,939
comments
94,698
users