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
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?
+1
vote
1
answer
1
Regular language
L={a^m b^n  mn=even} Is this language a regular language?
asked
2 days
ago
in
Theory of Computation
by
AIkiran01
(
199
points)

120
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
identifyclasslanguage
0
votes
0
answers
2
VirtualGate CFL or Regular language Identification
asked
6 days
ago
in
Theory of Computation
by
!KARAN
Junior
(
893
points)

36
views
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
3
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
in
Theory of Computation
by
jatin khachane 1
Active
(
3.2k
points)

42
views
theoryofcomputation
regularlanguages
identifyclasslanguage
0
votes
0
answers
4
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
in
Theory of Computation
by
sripo
Junior
(
931
points)

29
views
theoryofcomputation
dcfl
contextfreelanguages
identifyclasslanguage
+1
vote
0
answers
5
language class
L = { (ak.bp)p.an.bn  k,p,n>=0 } is this regular or cfl?
asked
Oct 3
in
Theory of Computation
by
Lone Wolf
Active
(
1.3k
points)

35
views
identifyclasslanguage
0
votes
0
answers
6
self doubt
name and explain the language which are context free,context sensitive i.e. FORTRAN is CSL, now tell me about c,cobol,c++,java and any other language which you can explain etc https://gateoverflow.in/80293/gate19871xiii
asked
Sep 30
in
Theory of Computation
by
Gurdeep Saini
Active
(
5k
points)

18
views
contextfreelanguage
identifyclasslanguage
+2
votes
2
answers
7
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
(
7.4k
points)

93
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
identifyclasslanguage
+1
vote
1
answer
8
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
(
7.4k
points)

108
views
theoryofcomputation
identifyclasslanguage
regularlanguages
regularexpressions
0
votes
1
answer
9
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
(
103k
points)

149
views
theoryofcomputation
regularlanguages
identifyclasslanguage
+2
votes
1
answer
10
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
(
25.8k
points)

87
views
theoryofcomputation
identifyclasslanguage
0
votes
1
answer
11
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
(
8.3k
points)

47
views
theoryofcomputation
identifyclasslanguage
+13
votes
9
answers
12
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
in
Theory of Computation
by
gatecse
Boss
(
18.3k
points)

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

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

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

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

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

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

36
views
theoryofcomputation
identifyclasslanguage
0
votes
0
answers
19
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
(
13.4k
points)

28
views
identifyclasslanguage
+4
votes
3
answers
20
TIFR2018B14
Define the language $\text{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 ... regular. 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
(
368k
points)

315
views
tifr2018
identifyclasslanguage
+4
votes
2
answers
21
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 not ... 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
(
368k
points)

299
views
tifr2018
identifyclasslanguage
theoryofcomputation
+1
vote
1
answer
22
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
(
997
points)

77
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
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
IIT HYDERABAD M.Tech (RA) 3Years Winter Session Interview experience
INDIAN AIR FORCE
GATE BOOK _ TEST SERIES DOUBT_
Visualizing complex C code
GATE Book Test Series
Follow @csegate
Gatecse
Recent questions tagged identifyclasslanguage
Recent Blog Comments
There is one more problem. Ppl who have...
CL013924707IN rt?
I ordered the GO BOOK 6 dec ....but still i didnt...
thankyou sir
44,236
questions
49,721
answers
163,905
comments
65,835
users