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.
Recent questions tagged regularlanguages
0
votes
1
answer
1
Regular Expressions
L1={anbm:n>=3,m<=4} Find complement of L1
asked
Feb 14
in
Theory of Computation
by
Ahsanul Hoque
(
67
points)

66
views
regularlanguages
theoryofcomputation
0
votes
0
answers
2
Regular Language
asked
Feb 2
in
Theory of Computation
by
vijay_jr
Active
(
1.2k
points)

46
views
theoryofcomputation
regularlanguages
finiteautomata
0
votes
0
answers
3
#Practise Class of Languages
$xwxw^r \ w,x \in (a,b)^*$ $wxw^{r}x \ w,x \in (a,b)^*$
asked
Jan 31
in
Theory of Computation
by
Anjan
Active
(
1.8k
points)

29
views
theoryofcomputation
regularlanguages
0
votes
0
answers
4
Regular Languages
Language {w  ww=www} is regular. How and what is this language?
asked
Jan 31
in
Theory of Computation
by
gauravkc
Loyal
(
4.1k
points)

23
views
theoryofcomputation
regularlanguages
+1
vote
0
answers
5
Regular  Context Free?
Let L be a given contextfree language over the alphabet {a, b}. Construct L1, L2 as follows. Let L1 = L − {xyx  x, y ∈ {a, b}∗}, and L2 = L·L. Then, (A) Both L1 and L2 are regular. B) Both L1 and L2 are context free but not necessarily regular. (C) L1 is regular and L2 is context free. (D) L1 and L2 both may not be context free
asked
Jan 31
in
Theory of Computation
by
Tuhin Dutta
Boss
(
7.8k
points)

57
views
theoryofcomputation
contextfreelanguage
regularlanguages
+1
vote
1
answer
6
Made easy test
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none
asked
Jan 29
in
Theory of Computation
by
♥_Less
Active
(
1k
points)

55
views
madeeasytestseries
regularexpressions
regularlanguages
contextfreelanguage
contextsensitive
+1
vote
0
answers
7
Made Easy test series
a) Only L1 is correct b)Only L2 is correct c)Both L1 and L2 are correct d)None of L1 and L2 is correct My question is: What is meant by prefix of string? And how is L1 regular?
asked
Jan 22
in
Theory of Computation
by
Sumaiya23
Active
(
1.4k
points)

34
views
madeeasytestseries
theoryofcomputation
regularlanguages
+3
votes
2
answers
8
TOC DFA
I got 3 states... Given is 4
asked
Jan 16
in
Theory of Computation
by
Ashwin Kulkarni
Veteran
(
17.1k
points)

72
views
theoryofcomputation
regularlanguages
contextfreelanguage
+2
votes
1
answer
9
regular expressions
Answer is c. but i think it should be b as r1 = (0+1)* = r2=r3. please correct me if i m wrong
asked
Jan 12
in
Theory of Computation
by
amIndian
(
93
points)

75
views
theoryofcomputation
regularexpressions
regularlanguages
finiteautomata
+1
vote
2
answers
10
Self oubt
Are the languages produced (a+b)* and (a*b*)* same?
asked
Jan 10
in
Theory of Computation
by
ankit_thawal
Loyal
(
2.5k
points)

28
views
regularlanguages
+1
vote
0
answers
11
regular language
Is there any difference bw L3 and L31
asked
Jan 8
in
Theory of Computation
by
Pawan Kumar 2
Boss
(
5.1k
points)

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

151
views
contextfreelanguage
theoryofcomputation
identifyclasslanguage
regularlanguages
grammar
+1
vote
0
answers
13
TOC Regular Language
Which of the following languages over the alphabet A = {0, 1} is regular? 1. {w ε A* : Ǝu ε A* such that w = uu} 2. {w ε A* : w does not contain any 1’s in even positions, where the leftmost is position 1} 3. {w ε A* : w contains a 1 in every position that is a power of 2}
asked
Jan 5
in
Theory of Computation
by
Harish Karnam
Active
(
2k
points)

47
views
theoryofcomputation
regularlanguages
+1
vote
1
answer
14
Regular expressions
asked
Jan 1
in
Theory of Computation
by
Aakanchha
Junior
(
667
points)

61
views
theoryofcomputation
regularexpressions
regularlanguages
#theoryofcomputation
+4
votes
0
answers
15
Find Regular
Which one is Regular? 1)$L_{1}=\left \{ a^{x}b^{y}c^{z}  \left ( x=y\vee y=z \right ) \wedge x+y+z\leq 100\right \}$ 2)$L_{2}=\left \{ a^{x}b^{y}c^{z}  \left ( x=y\vee y=z \right ) \wedge x+y+z\geq 100\right \}$
asked
Dec 30, 2017
in
Theory of Computation
by
srestha
Veteran
(
81.5k
points)

58
views
theoryofcomputation
regularlanguages
0
votes
1
answer
16
closure property
CFL over a single alphabet are always> A. dcfl B. regular C. dcfl but not regular d. non regular
asked
Dec 30, 2017
in
Theory of Computation
by
raviyogi
Loyal
(
2.6k
points)

57
views
theoryofcomputation
contextfreelanguage
closureproperty
regularlanguages
0
votes
0
answers
17
Regular Expression
Let say we have given 10 Regular Expression and we need to check which of them is pointing to the same Regular Language. Then which one of the following is best method Brute Force method (Take some string and cross verify it) Create Minimal dfa for them Using intuition You are trying to observe the language pattern
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Loyal
(
2.6k
points)

64
views
regularexpressions
theoryofcomputation
regularlanguages
0
votes
0
answers
18
Regular Expression
L1 = (a + b)* b (a+b)* L2 = a* b (a+b)* L3 = (a+b)* ba* Explain L1 = L2 = L3 ?
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Loyal
(
2.6k
points)

68
views
theoryofcomputation
regularexpressions
regularlanguages
+1
vote
1
answer
19
Regular Expression
L1 = (0 + 11*0)* L2 = (1*0)* Explain L1 = L2 ?
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Loyal
(
2.6k
points)

77
views
theoryofcomputation
regularexpressions
regularlanguages
+1
vote
0
answers
20
Ace Academy Test Series 2018
Consider a language L1 and L2 L1 = 1* 0 1* 0 L2 = 0* 1 0* 1 Then the quotient of L1 and L2 is ε Φ 0* 1*
asked
Dec 23, 2017
in
Theory of Computation
by
hacker16
Loyal
(
2.6k
points)

136
views
acetestseries
theoryofcomputation
regularlanguages
0
votes
0
answers
21
Given Language is Context free or Regular ?
asked
Dec 18, 2017
in
Theory of Computation
by
hacker16
Loyal
(
2.6k
points)

84
views
theoryofcomputation
regularlanguages
contextfreelanguage
0
votes
0
answers
22
Regular or not
L={0^p1^q  p=5q} is this language is regular or not. My doubt is Since every finite language is regular and we can see the all possible values of (p,q) will be (0,5),(1,4),(2,3),(3,2),(4,1),(5 ... } So the language is regular. But somewhere i read that whenever any linear equation come with language then language is not regular. Please clear my doubt
asked
Dec 15, 2017
in
Theory of Computation
by
manish suthar
(
73
points)

31
views
regularlanguages
theoryofcomputation
0
votes
0
answers
23
Regular language
Is L2 regular?
asked
Dec 14, 2017
in
Theory of Computation
by
Tuhin Dutta
Boss
(
7.8k
points)

74
views
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
1
answer
24
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
Active
(
1.3k
points)

58
views
theoryofcomputation
identifyclasslanguage
contextfreelanguage
regularlanguages
0
votes
0
answers
25
TOC doubts test series
State whether statement is true or false. 1. (a+b)*.anbn is regular . 2. Language produced by grammar S > AaB A>aC  $\epsilon$ B>aBbB$\epsilon$ C>aCb$\epsilon$ is regular. 3. Language produced ... equal to number of occurrences of "ba" } 6. Given a grammar, checking if the grammar is not regular is decidable problem.
asked
Dec 5, 2017
in
Theory of Computation
by
sumit chakraborty
Active
(
1.4k
points)

56
views
theoryofcomputation
regularlanguages
contextfreelanguage
0
votes
0
answers
26
Regular
Is it regular {xy x,y $\epsilon$ (0,1)* such that n0(x)=n1(y)} ?
asked
Dec 5, 2017
in
Theory of Computation
by
junaid ahmad
Veteran
(
12.5k
points)

29
views
regularlanguages
0
votes
0
answers
27
Toc doubt
asked
Dec 3, 2017
in
Theory of Computation
by
Parshu gate
Boss
(
6.4k
points)

37
views
theoryofcomputation
regularlanguages
contextfreelanguage
+3
votes
0
answers
28
Infinite union of regular languages.
asked
Dec 2, 2017
in
Theory of Computation
by
Hemant Parihar
Veteran
(
15k
points)

146
views
theoryofcomputation
regularlanguages
+4
votes
1
answer
29
Stanford(Regular expression)
This DFA accepts a certain language L. In this problem we shall consider certain other languages that are defined by their tails, that is, languages of the form (0+1)*w, for some particular string w of 0's and 1's. Call this language L(w). ... . L(110101) is contained in L. C). L(1111001) is contained in L. D). L(110101) is disjoint from L.
asked
Dec 2, 2017
in
Theory of Computation
by
vijay_jr
Active
(
1.2k
points)

85
views
regularexpressions
theoryofcomputation
regularlanguages
+2
votes
0
answers
30
Regular
Is this regular L={w  w $\varepsilon$ (0,1)* w is of the form (0i1)n for i=1,2,3...n ,n>=0} ?
asked
Dec 1, 2017
in
Theory of Computation
by
junaid ahmad
Veteran
(
12.5k
points)

62
views
theoryofcomputation
regularlanguages
Page:
1
2
3
4
5
6
...
11
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
isro sc 2017 2nd paper
Which college to expect?
Interview Guidance
CDAC CoursesAugust session
Counselling...
Follow @csegate
Gatecse
Recent questions tagged regularlanguages
Recent Blog Comments
Okay Thanks
i think they call everyone ith a score higher ...
@raviyogi Do you know what was the cutoff ot IIT ...
I think the exam has not yet been created.
Then why it's not appearing as a separate exam in ...
33,712
questions
40,255
answers
114,367
comments
38,883
users