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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}n<m,n,m\geq 1 \right \}$
asked
May 24
in
Theory of Computation
by
srestha
Veteran
(
86.9k
points)

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

79
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
3
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
in
Theory of Computation
by
ankitgupta.1729
Loyal
(
6.1k
points)

36
views
theoryofcomputation
identifyclasslanguage
+12
votes
11
answers
4
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 \}$ $\{a^mb^nc^pd^q \mid m=n =p \text{ and } p \neq q, \text ... =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
in
Theory of Computation
by
gatecse
Boss
(
18k
points)

2.3k
views
gate2018
theoryofcomputation
identifyclasslanguage
contextfreelanguage
normal
+1
vote
0
answers
5
#toc001
Both the languages have x,y belongs {0,1} then what type of languages are both L1={x ∣x has an equal number of a's and b's} L2={xy  #a's in x = #b's in y} For L1 i think it is CFL , on a's push onto the stack on seeing b pop from stack, finally stack empty accept the lang. For L2 how to find middle of string where x is ending and y is starting....??
asked
Jan 26
in
Theory of Computation
by
Anjan
Active
(
1.7k
points)

18
views
theoryofcomputation
identifyclasslanguage
+2
votes
1
answer
6
Context Free Language
Is B context free? Please explain in detail.
asked
Jan 6
in
Theory of Computation
by
Shubham Kumar Gupta
Junior
(
537
points)

174
views
contextfreelanguage
theoryofcomputation
identifyclasslanguage
regularlanguages
grammar
+1
vote
0
answers
7
Identify the language.
Identify the language. apbqcrds  p+r=q+s
asked
Jan 2
in
Theory of Computation
by
gari
Active
(
3.2k
points)

62
views
theoryofcomputation
identifyclasslanguage
+2
votes
0
answers
8
Identify class of language
L={ (anbn)*  n>0 }
asked
Dec 28, 2017
in
Theory of Computation
by
VS
Loyal
(
8.7k
points)

84
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
9
Class of LANGUAGE
asked
Dec 21, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

55
views
identifyclasslanguage
theoryofcomputation
0
votes
0
answers
10
Class of language
asked
Dec 21, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

34
views
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
11
language identify
here my doubt is the language generated by above contain compression among substring or not.... what is a type of language is generated here??
asked
Dec 17, 2017
in
Theory of Computation
by
Hira Thakur
Boss
(
12.5k
points)

25
views
identifyclasslanguage
+4
votes
2
answers
12
TIFR2018B14
Define the language $INFINITE_{DFA}\equiv \{(A)\mid A \text{ is a DFA and } L(A) \text{ is an infinite language}\},$ where $(A)$ denotes the description of the deterministic finite automata (DFA).Then which of the following about ... . It is Turing decidable (recursive). It is Turing recognizable but not decidable. Its complement is Turing recognizable but it is not decidable.
asked
Dec 10, 2017
in
Theory of Computation
by
Arjun
Veteran
(
349k
points)

220
views
tifr2018
identifyclasslanguage
+1
vote
1
answer
13
Identify Class of Grammar
Hi mates, Please Identify Class of grammr with suitable Explanation, 1) L={WXW,/ W,X{a,b}*} 2) L={WXW,/ W,X{a,b}+} 3) L={WXWY,/ W,X,Y{a,b}+} 4)L={WXYW,/ W,X,Y{a,b}+} Thanks,
asked
Dec 7, 2017
in
Theory of Computation
by
Sahil1994
Junior
(
971
points)

62
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
+1
vote
1
answer
14
Identify the language
$L = \{ wcww^r \ w,c\ \epsilon\ ( a + b\ )^* \}$ Identify the language.
asked
Dec 4, 2017
in
Theory of Computation
by
Tuhin Dutta
Loyal
(
7.9k
points)

83
views
theoryofcomputation
identifyclasslanguage
0
votes
2
answers
15
Self doubt in Class of language
If L1 is regular and L2 is CFL then L1.L2 ( . => concat) is ?
asked
Nov 29, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

48
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
contextfreelanguages
+6
votes
2
answers
16
Identify class of Language(Asked in comment of gate2014236)
asked
Nov 22, 2017
in
Theory of Computation
by
Chhotu
Boss
(
10.5k
points)

112
views
theoryofcomputation
identifyclasslanguage
+2
votes
1
answer
17
Problem
What is Equality Problem in Theory of computation?
asked
Nov 21, 2017
in
Theory of Computation
by
Nikhil Patil
(
371
points)

39
views
theoryofcomputation
decidability
contextfreelanguage
identifyclasslanguage
0
votes
0
answers
18
Context free or not
How to understand such problems?
asked
Nov 20, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

69
views
contextfreelanguage
identifyclasslanguage
contextfreegrammars
+1
vote
1
answer
19
class of the language
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? (A) L is regular, but not contextfree. (B) L is contextfree, but not regular. (C) L is Σ*. (D) None of these.
asked
Nov 15, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

35
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
0
votes
0
answers
20
class of the 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? (A) L is regular, but not contextfree. (B) L is contextfree, but not regular. (C) L is Σ*. (D) None of these.
asked
Nov 15, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

29
views
identifyclasslanguage
theoryofcomputation
contextfreelanguage
0
votes
0
answers
21
regular and context free
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? (A) L is regular, but not contextfree. (B) L is contextfree, but not regular. (C) L is Σ*. (D) None of these.
asked
Nov 15, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

27
views
contextfreegrammars
identifyclasslanguage
theoryofcomputation
+6
votes
3
answers
22
[TOC] Identify class of language
L={$a^m$$b^n$  m <= n <= 3m }
asked
Nov 12, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
24.1k
points)

95
views
theoryofcomputation
identifyclasslanguage
+3
votes
1
answer
23
context free language
$L_1 =\{a^n b^m c^n \mid m,n \geq 0\}$ and $L_2=\{ a^n b^n\mid n\geq 0\}$. If $L=L_2L_1$ then $L$ is finite language regular language DCFL not DCFL
asked
Nov 10, 2017
in
Theory of Computation
by
Prateek Raghuvanshi
Active
(
3.9k
points)

94
views
contextfreelanguage
identifyclasslanguage
0
votes
0
answers
24
CFL , HOW TO SOLVE THESE TYPE OF PROBLEMS
asked
Nov 6, 2017
in
Theory of Computation
by
Parshu gate
Active
(
4.9k
points)

67
views
theoryofcomputation
contextfreelanguage
identifyclasslanguage
0
votes
1
answer
25
Class of Language and Decidability
Question 1 >> Consider the following two languages: Which of the following statement is true? a. L1 is CSL and L2 is CFL but not CSL b. Both L1 and L2 are CSL but not CFL c. Both L1 and L2 are CSL but not CFL d. Both L1 and L2 ... language is CSL but not CFL, but I think it should be D) both language is CFL but not regular. is there something I am missing.
asked
Nov 2, 2017
in
Theory of Computation
by
Shubhanshu
Boss
(
15k
points)

40
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
contextfreelanguages
0
votes
0
answers
26
#TOC Identify Language
L = {ab3k  k>=0} wel, I think, this L is RL, as it has REGEX as a(bbb)*. Please correct me.
asked
Sep 20, 2017
in
Theory of Computation
by
iarnav
Loyal
(
7.3k
points)

51
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
+1
vote
1
answer
27
#TOC Identify Class of Language
1. L = {w  w ∈ {a,b}, na(w) >= nb(w)+1} 2. L = {aibj  i ≠ 2j+1} 3. L = {ambn  m=2n+1} NOTE: 1  DCFL, 2  DCFL, 3 DCFL, but need a proper reason!
asked
Sep 19, 2017
in
Theory of Computation
by
iarnav
Loyal
(
7.3k
points)

117
views
theoryofcomputation
identifyclasslanguage
dcfl
contextfreelanguages
contextfreelanguage
0
votes
1
answer
28
Identify type of grammer
Identify type of grammer: S> a  $\epsilon$ 1. TYPE 0 2. TYPE 1 3. TYPE 2 4. TYPE 3
asked
Sep 11, 2017
in
Theory of Computation
by
rahul sharma 5
Boss
(
24.1k
points)

65
views
theoryofcomputation
identifyclasslanguage
+1
vote
0
answers
29
Identify Languange
What is nature of this Language (a ^ n) * (b ^ m) where n^2+m^2=16. Here no condition of n and m is provided. So i think we need to consider best solution for this type of question. Kindly assist.
asked
Sep 7, 2017
in
Theory of Computation
by
nitish
Active
(
1.5k
points)

54
views
theoryofcomputation
identifyclasslanguage
laguages
+2
votes
1
answer
30
Identify the language
1. L = { w0x  w,x>=2 and w,x $\epsilon$ (0,1)*} 2. L = {w0x  w,x is even and w,x $\epsilon$ (0,1)*} PS: '0' is zero everywhere. Are these two regular?
asked
Sep 6, 2017
in
Theory of Computation
by
Warlock lord
Active
(
3.4k
points)

35
views
identifyclasslanguage
theoryofcomputation
Page:
1
2
3
4
5
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
IISc CSA and CDCS written test and interview Experince
IIIT Hyderabad Interview Experience
My failure, Oh wait SUCCESS journey
ALGORITHMS CHECKLIST:
A Failure who got into IISc
Follow @csegate
Gatecse
Recent questions tagged identifyclasslanguage
Recent Blog Comments
Sir I didn't get an email for GO classroom, ...
any one with marks less than 125 selected?
Thank you @Arjun Sir, @NamitaAIR1, @Priyanka, ...
Your story is very inspiring for the boys like me ...
So you completed your Btech in 5 yrs? How could ...
36,194
questions
43,647
answers
124,088
comments
42,929
users