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
+1
vote
1
answer
1
Regular Expression
Ans. D
asked
Sep 2, 2018
in
Theory of Computation
by
Na462
Loyal
(
7k
points)

150
views
theoryofcomputation
regularexpressions
finiteautomata
+2
votes
4
answers
2
Automata to Regular Expression
Ans. C
asked
Sep 2, 2018
in
Theory of Computation
by
Na462
Loyal
(
7k
points)

135
views
finiteautomata
regularexpressions
theoryofcomputation
expression
+1
vote
0
answers
3
Regular expression
Ans. B
asked
Sep 2, 2018
in
Theory of Computation
by
Na462
Loyal
(
7k
points)

74
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
2
answers
4
TOC Finite Automata
How to construct a finite automata equivalent to the regular expression: ( 0 + 1 )* ( 00 + 11 ) ( 0 + 1 )*
asked
Sep 1, 2018
in
Theory of Computation
by
iarnav
Loyal
(
8.4k
points)

792
views
finiteautomata
theoryofcomputation
regularexpressions
0
votes
1
answer
5
Theory of computation
Which of the following CFG’s can’t be simulated by an FSM ? a. S>Sa/b b. S>aSb/ab c. S>abX, X>cY, Y>d/aX d. None of these
asked
Aug 31, 2018
in
Theory of Computation
by
Rackson
Active
(
1.8k
points)

174
views
theoryofcomputation
finiteautomata
regularexpressions
0
votes
1
answer
6
GATE 2014 Set 1 Q65
Which of the regular expressions given below represent the following DFA? A) 0*1(1+00*1)* B) 0*1*1+11*0*1 C) (0+1)*1
asked
Aug 31, 2018
in
Theory of Computation
by
aditi19
Active
(
5.2k
points)

163
views
regularexpressions
0
votes
2
answers
7
Peter LinzDoubt
Give regular expression for all strings not ending with '01' on Σ={0, 1}. is this expression correct? (ɛ+1*0*+(0+1)*1*0)*
asked
Aug 30, 2018
in
Theory of Computation
by
aditi19
Active
(
5.2k
points)

59
views
theoryofcomputation
regularexpressions
+1
vote
2
answers
8
Regular Expression
Ans. C
asked
Aug 30, 2018
in
Theory of Computation
by
Na462
Loyal
(
7k
points)

70
views
theoryofcomputation
regularexpressions
regularlanguages
0
votes
1
answer
9
Regular Expression Identities
${(a+aa+b)}^{+}={(a+b)}^{+}$
asked
Aug 20, 2018
in
Theory of Computation
by
Dhananjay15
(
61
points)

114
views
regularexpressions
0
votes
0
answers
10
RE Ques
Represent the language over ∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.
asked
Aug 15, 2018
in
Theory of Computation
by
Devshree Dubey
Boss
(
13.8k
points)

86
views
regularexpressions
theoryofcomputation
0
votes
2
answers
11
RE Ques
Describe in simple English the language represented by the regular expression r=(1+10)*
asked
Aug 15, 2018
in
Theory of Computation
by
Devshree Dubey
Boss
(
13.8k
points)

91
views
regularexpressions
theoryofcomputation
0
votes
1
answer
12
Regular Expression
How do we derive a regular expression from a given language?
asked
Aug 15, 2018
in
Theory of Computation
by
Devshree Dubey
Boss
(
13.8k
points)

44
views
theoryofcomputation
regularexpressions
0
votes
1
answer
13
Regular Language
asked
Aug 12, 2018
in
Theory of Computation
by
jatinkumar
(
315
points)

99
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
0
votes
1
answer
14
regular expressions
The regular expression denoting the set of all strings not containing two consecutive 1's is given by A) (0+10)*(EPSILON+0) B) (1+01)* C) (0+10)*(EPSILON+1) D) (EPSILON+0)(001)*(EPSILON+0)
asked
Aug 10, 2018
in
Theory of Computation
by
Sindhu Bandaru
(
13
points)

122
views
regularexpressions
0
votes
1
answer
15
Regular expressions
The regular expression (aa)* + a (aa)*+ aaaaa*a* is the same as A) (a+aa+aaa)* B) aaa* + aaaaa* + aaaaaa* C) (aaa)*a****(a*+aa*)a+ D) none of the above
asked
Aug 9, 2018
in
Theory of Computation
by
Sindhu Bandaru
(
13
points)

74
views
regularexpressions
0
votes
2
answers
16
Regular expression
Is a*b* + b*a* = ( a + b)* ______
asked
Jul 31, 2018
in
Theory of Computation
by
Ajaaz
(
37
points)

197
views
theoryofcomputation
regularexpressions
finiteautomata
nfadfa
0
votes
0
answers
17
#Test series
https://gateoverflow.in/188609/metestseries This question has not been answered, can somebody solve it!
asked
Jul 31, 2018
in
Theory of Computation
by
himgta
Active
(
3.7k
points)

99
views
#
regularexpressions
0
votes
1
answer
18
MadeEasy Test Series: Theory Of Computation  Regular Expressions
Consider the following regular expression (RE) RE= (aa+abb)^+ (a+b+ba)^+ (a+b)^+ How many minimal strings exist for above RE? (a) 3 (b) 4 (c) 5 (d) 6
asked
Jul 30, 2018
in
Theory of Computation
by
ROHIT SHARMA 5
(
139
points)

63
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
1
answer
19
theory of computation
check whether given language is regular or not 1) (an) n where n ≥1 2) ( am ) n where n ≥ 1 3) w= { (( a 2 ) n) * (( an )2 )* } where n ≥ 1
asked
Jul 24, 2018
in
Theory of Computation
by
Rahul_Rathod_
(
431
points)

134
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
2
answers
20
theory of computation
{ W X Wr  w,x ∈ (a+b)+ } this language is regular....how?
asked
Jul 24, 2018
in
Theory of Computation
by
Rahul_Rathod_
(
431
points)

101
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
2
answers
21
Doubt Regular Language and regular expressions
Is it safe to say (ab*)* = (a+b)*  {b}? or any string will be missed apart from b
asked
Jul 16, 2018
in
Theory of Computation
by
abhiram144
(
281
points)

133
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
1
answer
22
GATE  TOC Regular Languages & FA
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)? a) (b*ab*ab*ab*)* b) (b*ab*ab*)* c) (b*ab*ab*)^6 d) (b*ab*ab*ab*ab*ab*ab*)* Please do explain also.
asked
Jul 15, 2018
in
Theory of Computation
by
Ashish Roy 1
(
167
points)

171
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
23
regular expressions
asked
Jul 8, 2018
in
Theory of Computation
by
once_2019
Junior
(
851
points)

140
views
theoryofcomputation
regularexpressions
+2
votes
1
answer
24
#Regular Expression
Which one of the Regular Expression given defines the same language as defined by R = (a + b)* (aa + bb) (a + b)* ? (a) (a (ba)* + b (ab)*) (a + b)* (b) (a (ba)* + b (ab)*)* (a + b)* (c) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)* (d) (a (ba)* (a + bb) + b (ab)* (b + aa)) (a + b)+
asked
Jul 8, 2018
in
Theory of Computation
by
himgta
Active
(
3.7k
points)

102
views
regularexpressions
0
votes
1
answer
25
Ullman
What will be the regular expression for the language consisting of all binary strings which have at most one pair of consecutive zeroes?
asked
Jul 6, 2018
in
Theory of Computation
by
Lakshay Kakkar
Active
(
2k
points)

154
views
regularexpressions
0
votes
1
answer
26
Language of strings not containing 101
Can someone show how we can systematically come up with regular expression for language not containing string 101 on alphabet {0,1} by first creating DFA and then converting it to regular expression?
asked
Jul 6, 2018
in
Theory of Computation
by
GateAspirant999
Active
(
2.5k
points)

562
views
theoryofcomputation
regularexpressions
0
votes
1
answer
27
Simplifying regular expressions
What is regex for the DFA: I am coming up with following two: 1. b*a(a+b)* and 2. b*a(b+ab*a)*+b*ab*a(ab*a+b)* Both seems to be correct to me. For X1, we have regex b*a(b+ab*a) For X2, we have regex b*ab*a(ab*a ... question: I want to know if I can simplify regex 2 to regex 1 by regex identities, but not by any other approach say by dfa minimization. Is it possible?
asked
Jul 1, 2018
in
Theory of Computation
by
GateAspirant999
Active
(
2.5k
points)

186
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
1
answer
28
Regular Expressions
What is the language produced by.... null*(denoted by phi) doubt from youtube video here
asked
Jun 19, 2018
in
Theory of Computation
by
Kirandas R
(
81
points)

104
views
theoryofcomputation
regularexpressions
0
votes
1
answer
29
MadeEasy Test Series: Theory Of Computation  Regular Expressions
Can someone explain this problem? Thanks in advance
asked
Jun 17, 2018
in
Theory of Computation
by
Kalpataru Bose
(
413
points)

152
views
madeeasytestseries
theoryofcomputation
regularexpressions
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged regularexpressions
Recent Blog Comments
@Abhisheksawarn608 what makes you think...
I am getting 151 marks excluding question not...
Thank you @Arjun sir :)
Thanks for that @rohit1001
@Dumbest Kid > Jocko Podcast
50,737
questions
57,296
answers
198,262
comments
104,973
users