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?
+2
votes
2
answers
1
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
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

52
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
identifyclasslanguage
+1
vote
1
answer
2
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
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

74
views
theoryofcomputation
identifyclasslanguage
regularlanguages
regularexpressions
0
votes
1
answer
3
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
(
95.8k
points)

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

82
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
5
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
(
7.2k
points)

42
views
theoryofcomputation
identifyclasslanguage
+13
votes
10
answers
6
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
(
18.1k
points)

2.6k
views
gate2018
theoryofcomputation
identifyclasslanguage
contextfreelanguage
normal
+1
vote
0
answers
7
#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)

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

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

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

91
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
11
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
12
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
13
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.9k
points)

25
views
identifyclasslanguage
+4
votes
2
answers
14
TIFR2018B11
Consider the language $L\subseteq \left \{ a,b,c \right \}^{*}$ defined as $L = \left \{ a^{p}b^{q}c^{r} : p=q\quad or\quad q=r \quad or\quad r=p \right \}.$ Which of the following answer is TRUE about complexity of this language? $L$ is regular but ... of $L,$ defined as $\overline{L} = \left \{ a,b,c \right \}^{*}/L,$ is regular. $L$ is regular, contextfree and decidable
asked
Dec 10, 2017
in
Theory of Computation
by
Arjun
Veteran
(
357k
points)

223
views
tifr2018
identifyclasslanguage
theoryofcomputation
+4
votes
2
answers
15
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
(
357k
points)

232
views
tifr2018
identifyclasslanguage
+1
vote
1
answer
16
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)

68
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
+1
vote
1
answer
17
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
(
8.1k
points)

88
views
theoryofcomputation
identifyclasslanguage
0
votes
2
answers
18
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)

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

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

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

75
views
contextfreelanguage
identifyclasslanguage
contextfreegrammars
+1
vote
1
answer
22
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
23
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
24
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
25
[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.7k
points)

102
views
theoryofcomputation
identifyclasslanguage
+3
votes
1
answer
26
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
Loyal
(
5.8k
points)

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

71
views
theoryofcomputation
contextfreelanguage
identifyclasslanguage
0
votes
1
answer
28
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
(
15.2k
points)

41
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
contextfreelanguages
0
votes
0
answers
29
#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
(
8.1k
points)

53
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
+1
vote
1
answer
30
#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
(
8.1k
points)

119
views
theoryofcomputation
identifyclasslanguage
dcfl
contextfreelanguages
contextfreelanguage
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
ace test series 2019
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Follow @csegate
Gatecse
Recent questions tagged identifyclasslanguage
Recent Blog Comments
You are posting a question as a blog, go to...
@Swaraj i got 74.22 %
@sanjay sharma , my gmail id ...
@sanjay sharma my mail id is
[email protected]
yes btech (cs) are eligible and to get question...
39,586
questions
46,709
answers
140,149
comments
57,884
users