The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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 regularexpressions
Materials needed
Stanford slides
Colostate slides
0
votes
0
answers
1
Virtual GATE
Let A be a regular set. Consider the two sets below L1={x  $\exists n\geq 0, \exists y\epsilon A :$ y=$x^n$} L2={x  $\exists n\geq 0, \exists y\epsilon A :$ x=$y^n$} which of the following statements is true? L1 and L2 both are regular L1 is regular but L2 is not L1 is not regular but L2 is L1 and L2 both are nonregular
asked
1 day
ago
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

18
views
virtualgate
testseries
theoryofcomputation
regularlanguages
regularexpressions
0
votes
0
answers
2
#TOC What will be the minimal DFA of this regular language?
Given L = { 0*1 + 0 + 1* + 10*1} where + symbol is UNION and NOT positive closure. Please draw the Minimal DFA for this.
asked
4 days
ago
in
Theory of Computation
by
iarnav
Loyal
(
9.6k
points)

50
views
finiteautomata
regularexpressions
regs
theoryofcomputation
pumpinglemma
0
votes
1
answer
3
Peter Linz Edition 4 Exercise 3.1 Question 5 (Page No. 75)
what is the regular grammar for L={$a^nb^m$  n+m is even}
asked
Feb 24
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

152
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
regulargrammar
+1
vote
1
answer
4
Peter Linz Edition 4 Exercise 3.2 Question 10.b (Page No. 88)
What is the regular expression for this
asked
Feb 22
in
Theory of Computation
by
aditi19
Active
(
2.4k
points)

142
views
theoryofcomputation
peterlinz
finiteautomata
regularlanguages
regularexpressions
0
votes
2
answers
5
MadeEasy WorkBook: Theory of Computation  Regular Expression
Given answer is option c. Can anyone tell me how?
asked
Feb 16
in
Theory of Computation
by
Jyoti Kumari97
(
225
points)

142
views
regularexpressions
theoryofcomputation
madeeasybooklet
0
votes
1
answer
6
#TOC #Examples
Give examples of: Countable Infinite Set Countable Finite Set Uncountable Finite Set Uncountable Infinite Set
asked
Jan 31
in
Theory of Computation
by
Reshu $ingh
(
345
points)

58
views
theoryofcomputation
finiteautomata
regularexpressions
0
votes
0
answers
7
#TOC #GeneralGuidance
I am new to the topic of TOC and finding it difficult to develop intuition for questions. Though,I am good with Mathematics and someone told TOC is mathematical concept. How should I study TOC specifically?
asked
Jan 30
in
Theory of Computation
by
Reshu $ingh
(
345
points)

40
views
theoryofcomputation
finiteautomata
regularexpressions
decidability
0
votes
0
answers
8
made easy
let l,m,n be the 3 regular expressions. consider the following identities. 1.( l*m*n*)* = (lm*+mn*+nl*)* 2.(mn+m)*m = m(nm + m)* 3.(l*m*n*)* = (l* + m*n + n*)* 4.(l*m)* = (l+m)* how many of the above identities are correct?
asked
Jan 26
in
Theory of Computation
by
screddy1313
(
401
points)

84
views
theoryofcomputation
regularexpressions
0
votes
1
answer
9
self doubt
Consider the following Regular expression: (a+b)*abb(a+b)* (a+b)*a(a+b)*bb(a+b)* (a+b)*ab(a+b)*b(a+b)* (a+b)*abb(a+b)*a Which of the above regular expression are equivalent ?
asked
Jan 25
in
Theory of Computation
by
Raj Kumar 7
Active
(
1.3k
points)

52
views
theoryofcomputation
regularexpressions
0
votes
2
answers
10
language
ϕ Σ* L X
asked
Jan 22
in
Theory of Computation
by
Rahul_Rathod_
Junior
(
565
points)

72
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
contextfreelanguage
0
votes
0
answers
11
Regular Expressions
Why this is not equal? (r+s)*=r*+s*
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
149
points)

60
views
regularexpressions
theoryofcomputation
0
votes
1
answer
12
Regular Languages
Is this language regular? If yes, how? L = {wxwR  x, w ϵ {0, 1}*} wR is reverse of string w. Thank you!
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
149
points)

62
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
2
answers
13
GATEBOOK2019 Mock Test132
The graph above represents a finite state machine. Which of the following regular expressions describes the set of strings recognized by the finite state machine? $10^\ast 1$ $10^\ast 1^{\ast }$ $10^\ast 1^{+ }$ $(0+1)^{*}$
asked
Jan 19
in
Theory of Computation
by
GATEBOOK
Boss
(
15.3k
points)

76
views
gb2019mock1
regularexpressions
0
votes
1
answer
14
Regular Expression
The answer given is none of these !! I think 1’st statement is the correct one, but still want to confirm
asked
Jan 16
in
Theory of Computation
by
Nandkishor3939
Active
(
1.2k
points)

46
views
theoryofcomputation
regularexpressions
0
votes
1
answer
15
Practice Question
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
asked
Jan 14
in
Theory of Computation
by
Hardik Maheshwari
(
113
points)

53
views
theoryofcomputation
regularexpressions
regularlanguages
regulargrammar
0
votes
0
answers
16
theory of autometa
let M be a finite autometa .let M' denote the machine obtained by interchanging the final and non final state L(M) U L(M') =sigma* L(M) $\cap$ L(M') =$\Phi$ how many statement is true and answer is both are true . no need to read the ... have to make non final state to final state and final to non final and no other change now the the correct image is so both statement is true
asked
Jan 11
in
Theory of Computation
by
Gurdeep Saini
Loyal
(
9k
points)

54
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
easy
0
votes
0
answers
17
MadeEasy Test Series: Theory Of Computation  Regular Languages
asked
Jan 9
in
Theory of Computation
by
Sambhrant Maurya
Active
(
1.5k
points)

74
views
madeeasytestseries
regularlanguages
regularexpressions
+1
vote
0
answers
18
MadeEasy Test Series: Theory Of Computation  Regular Expressions
Let x,y,z be regular expression.Let L1,L2 and L3 be regular expression defined as follows: L1=(x*y)*x*y L2=(x*y)(x*y)* L3=x*y(yx*)*y Find the relation between L1, L2 and L3? I solve such problems ... can have and other cannot. But sometimes I get messed up doing so, is there any better approach to solve such questions? Help Please!
asked
Jan 7
in
Theory of Computation
by
Shivam Kasat
Active
(
1.9k
points)

111
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
0
answers
19
Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
asked
Jan 5
in
Theory of Computation
by
sripo
Active
(
1.5k
points)

35
views
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
regularexpressions
0
votes
1
answer
20
MadeEasy Subject Test 2019: Theory Of Computation  Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
asked
Jan 1
in
Theory of Computation
by
sripo
Active
(
1.5k
points)

74
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
votes
1
answer
21
regular language
Stare true and false Is this regular ? now if it is not regular then i want to change in the question in place of (a+b)+ if it is (a+b)* then ??
asked
Dec 31, 2018
in
Theory of Computation
by
Gurdeep Saini
Loyal
(
9k
points)

57
views
theoryofcomputation
regularlanguages
regularexpressions
+1
vote
2
answers
22
NTA NET DEC 2018
asked
Dec 30, 2018
in
Theory of Computation
by
rakeshcoresoft
(
227
points)

133
views
regularlanguages
regularexpressions
0
votes
1
answer
23
regular expression for mod 3 =1
someone can help me found the regular expression of L={σ×w, σϵ∑={a, b},#σ(w)mod 3 = 1} tnx.
asked
Dec 30, 2018
in
Theory of Computation
by
bushez
(
15
points)

58
views
regularexpressions
0
votes
1
answer
24
made easy theory of computation regular expression
which one of the following regular expression describe the language over {a,b} consist of no pair of consecutive a’s? a. (b*abb*) (a+€) b. (b+ab)* (a+€) c. (b*abb*)*(a+€)+b* d. (b*ab*)*(a+€)+b*(a+€)
asked
Dec 28, 2018
in
Theory of Computation
by
Ram Swaroop
Active
(
2.5k
points)

66
views
regularexpressions
theoryofcomputation
finiteautomata
+1
vote
3
answers
25
GO2019FLT165
Consider the following operators used in an arbitrary regular expression parsing. (In all the below statements, capital letters denote the operator. Ignore quotes.) 'xPy' denotes a double occurrence of either x or y. 'xQ' denotes zero or ... expression: bSaSabPaaQ Which of the following strings does not belong to the above given regular expression? bbaaabba baaabb bbbaaaa baabbaaaa
asked
Dec 27, 2018
in
Theory of Computation
by
Ruturaj Mohanty
Active
(
2.9k
points)

170
views
go2019flt1
regularexpressions
0
votes
0
answers
26
MadeEasy Test Series: Theory Of Computation  Regular Expressions
asked
Dec 26, 2018
in
Theory of Computation
by
Shivangi Parashar 2
(
361
points)

74
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
1
answer
27
regular expression
the regular expression for the given finite automata plz provide ans step by step
asked
Dec 24, 2018
in
Theory of Computation
by
suneetha
Junior
(
549
points)

52
views
regularexpressions
0
votes
0
answers
28
Regular expressions
→ Let LA = ab*a and LB = b*a. Let LA / LB = {x  xy∈ LA for some y ∈ LB}, then LA / LBis: 1.a 2.None of these. 3. ab* 4.ab*a
asked
Dec 24, 2018
in
Theory of Computation
by
Hardik Vagadia
(
495
points)

71
views
theoryofcomputation
regularexpressions
0
votes
1
answer
29
MadeEasy Test Series: Theory Of Computation  Regular Expressions
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
asked
Dec 23, 2018
in
Theory of Computation
by
suneetha
Junior
(
549
points)

58
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
2
answers
30
#TOC Regular Language Is this a regular set?
WXW^R where W,X belongs to (0,1)* W^R is reverse of a string!
asked
Dec 22, 2018
in
Theory of Computation
by
iarnav
Loyal
(
9.6k
points)

74
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
Page:
1
2
3
4
5
6
...
14
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
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
M.S admissions help
Thank you #GO
GATE CSE 2019 Admissions Part 2  Score Change, COAP and Internal Sliding
Follow @csegate
Recent questions tagged regularexpressions
Recent Blog Comments
"Gate is not a 100 m race...
The sensible ones, usually dont...
The sensible ones, usually dont do the shona janu...
Congratulations brother :)...
It might seem that I am kidding, but honestly,...
48,243
questions
52,720
answers
183,287
comments
68,191
users