The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent questions tagged regularexpressions
Materials needed
Stanford slides
Colostate slides
0
votes
2
answers
1
#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
(
259
points)

78
views
theoryofcomputation
finiteautomata
regularexpressions
0
votes
0
answers
2
#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
(
259
points)

45
views
theoryofcomputation
finiteautomata
regularexpressions
decidability
+1
vote
1
answer
3
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
(
481
points)

113
views
theoryofcomputation
regularexpressions
+1
vote
1
answer
4
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.1k
points)

67
views
theoryofcomputation
regularexpressions
0
votes
2
answers
5
language
ϕ Σ* L X
asked
Jan 22
in
Theory of Computation
by
Rahul_Rathod_
(
425
points)

91
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
contextfreelanguage
0
votes
1
answer
6
Regular Expressions
Why this is not equal? (r+s)*=r*+s*
asked
Jan 22
in
Theory of Computation
by
Abhipsa Mishra
(
99
points)

94
views
regularexpressions
theoryofcomputation
0
votes
1
answer
7
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
(
99
points)

79
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
8
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.3k
points)

56
views
theoryofcomputation
regularexpressions
0
votes
1
answer
9
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
(
93
points)

62
views
theoryofcomputation
regularexpressions
regularlanguages
regulargrammar
0
votes
0
answers
10
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
Boss
(
10.3k
points)

60
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
easy
0
votes
1
answer
11
MadeEasy Test Series: Theory Of Computation  Regular Languages
asked
Jan 9
in
Theory of Computation
by
Sambhrant Maurya
Active
(
3.5k
points)

104
views
madeeasytestseries
regularlanguages
regularexpressions
+1
vote
0
answers
12
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
(
3.2k
points)

149
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
0
answers
13
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
(
2.4k
points)

67
views
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
regularexpressions
0
votes
1
answer
14
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
(
2.4k
points)

110
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
votes
1
answer
15
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
Boss
(
10.3k
points)

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

374
views
regularlanguages
regularexpressions
0
votes
1
answer
17
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
(
13
points)

138
views
regularexpressions
0
votes
1
answer
18
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
(
4.6k
points)

108
views
regularexpressions
theoryofcomputation
finiteautomata
+1
vote
3
answers
19
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.6k
points)

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

107
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
1
answer
21
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
(
441
points)

58
views
regularexpressions
0
votes
0
answers
22
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
(
339
points)

80
views
theoryofcomputation
regularexpressions
0
votes
1
answer
23
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
(
441
points)

79
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
2
answers
24
#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
(
8.3k
points)

92
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
0
votes
1
answer
25
MadeEasy Subject Test 2019: Theory Of Computation  Regular Expressions
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
asked
Dec 22, 2018
in
Theory of Computation
by
suneetha
(
441
points)

83
views
madeeasytestseries
theoryofcomputation
regularexpressions
+8
votes
2
answers
26
TIFR2019B11
Consider the following nondeterministic automaton,where $s_1$ is the start state and $s_4$ is the final (accepting) state. The alphabet is $\{a,b\}$. A transition with label $\epsilon$ can be taken without consuming any symbol from the input. Which of the following regular expressions correspond to the language ... $(a+b)^*ba^*$ $(a+b)^*ba(aa)^*$ $(a+b)^*$ $(a+b)^*baa^*$
asked
Dec 18, 2018
in
Theory of Computation
by
Arjun
Veteran
(
425k
points)

236
views
tifr2019
theoryofcomputation
regularexpressions
+1
vote
2
answers
27
UGC NET 2016
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _____ equivalence classes. pls give a detailed solution
asked
Dec 14, 2018
in
Theory of Computation
by
aditi19
Active
(
5.1k
points)

141
views
#dfa
finiteautomata
equivalenceclasses
regularlanguages
regularexpressions
+2
votes
1
answer
28
TOC Which is(are) regular? Please explain 1 and 4.
Which of the following languages is regular? L = { bba (ba)* a^n1  n> 0 } L = {a^nb^n  n < 1000 } L = {a^nb^k  n is odd or k is even } L = {wxw^R  w,x ∈(0+1)* } 1, 3 and 4 2, 3, 4 2, 3 1, 2, 3, 4
asked
Dec 13, 2018
in
Theory of Computation
by
rahuljai
Junior
(
551
points)

124
views
contextsensitive
regularlanguages
contextfreelanguage
theoryofcomputation
regularexpressions
+2
votes
2
answers
29
Regular language
L={a^m b^n  mn=even} Is this language a regular language?
asked
Dec 12, 2018
in
Theory of Computation
by
AIkiran01
(
119
points)

242
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
identifyclasslanguage
0
votes
0
answers
30
regular expressions
Consider the following statements, which comprises the equality between some regular expressions: S1: ε. ф*= ε. ф+ S2: ф. ф* = ф .ф+ Select the correct option. Both S1 and S2 are correct. Both S1 and S2 are false. 3.S1 is false while S2 is correct. S1 is correct while S2 is fals
asked
Dec 6, 2018
in
Theory of Computation
by
Satbir
Boss
(
21.7k
points)

70
views
regularexpressions
Page:
« prev
1
2
3
4
5
6
7
8
9
...
17
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
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged regularexpressions
Recent Blog Comments
@Ayush Upadhyaya sir any approximate idea...
@Ayush Upadhyaya Thank you so much! ^_^
@JashanAroraNo No. Don't directly say no.Think a...
@jeetYes, I am sorry for that.I saw ECIL Advt...
Congratulations man! A little question, please?...
50,645
questions
56,587
answers
195,788
comments
101,841
users