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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
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
Loyal
(
8.3k
points)

34
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
(
3.7k
points)

99
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
(
6.7k
points)

81
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
(
987
points)

32
views
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
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
(
83
points)

36
views
testbooktestseries
theoryofcomputation
identifyclasslanguage
+3
votes
1
answer
6
GATEBOOK2019 Mock Test131
Consider the following language $L = \{ xcy \mid x= y$ and $x\neq y^{R} \}.$ Which of the following statements is true about $L?$ $L$ is regular $L$ is DCFL but not regular $L$ is CFL but not DCFL $L$ is Recursive but not CFL
asked
Jan 19
in
Theory of Computation
by
GATEBOOK
Boss
(
11.4k
points)

233
views
gb2019mock1
identifyclasslanguage
+1
vote
1
answer
7
GATEBOOK2019 Mock Test158
Given TMs $M_{1},M_{2},M_{3}, \ldots M_{n}$ and $L = \{x \mid \text{Every }M_{i} \text{ halts on input }x \},$ which of the following is TRUE about $L?$ $L$ is recursively enumerable but not recursive $L$ is Recursive but not Context free $L$ is Not Recursively Enumerable $L$ is regular
asked
Jan 19
in
Theory of Computation
by
GATEBOOK
Boss
(
11.4k
points)

206
views
gb2019mock1
identifyclasslanguage
recursiveandrecursivelyenumerablelanguages
0
votes
1
answer
8
GATEBOOK2019 Mock Test159
The language $\left \{ a^{n}ba^{m}: n,m \geq 0\right \}$ over alphabet $\{a,b\}$ is Regular Contextfree but not Regular Not Context free Finite
asked
Jan 19
in
Theory of Computation
by
GATEBOOK
Boss
(
11.4k
points)

67
views
gb2019mock1
identifyclasslanguage
0
votes
0
answers
9
MadeEasy Full Length Test 2019: Theory of Computation  Identify Class Languages
asked
Jan 15
in
Theory of Computation
by
MiNiPanda
Boss
(
21.8k
points)

183
views
identifyclasslanguage
theoryofcomputation
madeeasytestseries2019
madeeasytestseries
0
votes
2
answers
10
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
(
6.7k
points)

106
views
madeeasytestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
11
TOC languages
please tell me if i am wrong
asked
Jan 5
in
Theory of Computation
by
VIDYADHAR SHELKE 1
Junior
(
979
points)

12
views
identifyclasslanguage
+1
vote
1
answer
12
#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
(
7.9k
points)

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

48
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
+1
vote
1
answer
14
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
(
413k
points)

176
views
tifr2019
theoryofcomputation
identifyclasslanguage
+2
votes
1
answer
15
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)

210
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
identifyclasslanguage
0
votes
0
answers
16
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
(
1.8k
points)

54
views
theoryofcomputation
identifyclasslanguage
+4
votes
1
answer
17
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.4k
points)

148
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
+2
votes
0
answers
18
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.4k
points)

38
views
zeal
identifyclasslanguage
theoryofcomputation
zeal2019
+2
votes
1
answer
19
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.4k
points)

96
views
zeal
theoryofcomputation
identifyclasslanguage
zeal2019
0
votes
1
answer
20
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)

110
views
testbooktestseries
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
21
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.5k
points)

37
views
gateforumtestseries
theoryofcomputation
identifyclasslanguage
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
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Interview Experience at IITPalakkad
Follow @csegate
Recent questions tagged identifyclasslanguage
Recent Blog Comments
sir .I recvd a mail which states "Your...
https://drive.google.com/open?id=1lzQpNHE4Phvo9JFA...
Sir, I will say the "
THE PURPOSE OF...
Even though the pre booking is closed...if i go...
Can rely upon these notes?
49,808
questions
54,475
answers
188,226
comments
74,360
users