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. For hardcopy of previous year questions please see
here
Recent questions tagged regularexpressions
Materials needed
Stanford slides
Colostate slides
+1
vote
1
answer
1
Consider the following regular expression R=(a+b)* (a+b+ε)a
asked
6 days
ago
in
Theory of Computation
by
Kshitij Hansda
(
51
points)

55
views
regularexpressions
0
votes
0
answers
2
Peter linz
From a language L we create a new language chop2 (L)by removing the two leftmost symbols of every string in L. Specifically, chop2(L) = {w: vw ∈ L, with v= 2}. Show that if L is regular, then chop2 (L) is also regular.
asked
Sep 14
in
Theory of Computation
by
vaibhav singh 3
(
55
points)

21
views
theoryofcomputation
peterlinz
regularexpressions
finiteautomata
regularlanguages
+2
votes
2
answers
3
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
(
5.6k
points)

53
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
identifyclasslanguage
0
votes
1
answer
4
Testbook Regular expressions
asked
Sep 13
in
Theory of Computation
by
Mk Utkarsh
Boss
(
16.7k
points)

71
views
regularexpressions
theoryofcomputation
0
votes
1
answer
5
Doubt in regular expressions
Consider the regular expression R = a*b* + b*a*. The number of equivalence classes of Σ* to represent a language which is equivalent to R is ____________.
asked
Sep 12
in
Theory of Computation
by
goluabhinan
(
77
points)

40
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
+1
vote
1
answer
6
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
(
5.6k
points)

74
views
theoryofcomputation
identifyclasslanguage
regularlanguages
regularexpressions
0
votes
1
answer
7
regular expression
can i get all the formulas of expression (a+b)*.
asked
Sep 9
in
Theory of Computation
by
Prathap Ñsvr
(
59
points)

41
views
regularexpressions
0
votes
0
answers
8
test series
Consider this regular expression: r = (a*b)* + (b*a)* This is equivalent to (a) (a + b)* (b) (a + b)* · (ab)+ + (a + b)* (ba)+ (c) (a + b)*a + (a + b)* b (d) None of above
asked
Sep 3
in
Theory of Computation
by
navya n
(
339
points)

58
views
regularexpressions
testseries
+1
vote
1
answer
9
Regular Expression
Ans. D
asked
Sep 2
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

56
views
theoryofcomputation
regularexpressions
finiteautomata
0
votes
2
answers
10
Automata to Regular Expression
Ans. C
asked
Sep 2
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

37
views
finiteautomata
regularexpressions
theoryofcomputation
expression
+1
vote
0
answers
11
Regular expression
Ans. B
asked
Sep 2
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

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

59
views
finiteautomata
theoryofcomputation
regularexpressions
0
votes
1
answer
13
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
in
Theory of Computation
by
Things To Know (Thin
(
391
points)

35
views
theoryofcomputation
finiteautomata
regularexpressions
0
votes
1
answer
14
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
in
Theory of Computation
by
aditi19
Junior
(
689
points)

28
views
regularexpressions
0
votes
2
answers
15
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
in
Theory of Computation
by
aditi19
Junior
(
689
points)

32
views
theoryofcomputation
regularexpressions
+1
vote
1
answer
16
Regular Expression
Ans. C
asked
Aug 30
in
Theory of Computation
by
Na462
Loyal
(
5.6k
points)

31
views
theoryofcomputation
regularexpressions
regularlanguages
0
votes
0
answers
17
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
in
Theory of Computation
by
Devshree Dubey
Boss
(
13.5k
points)

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

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

20
views
theoryofcomputation
regularexpressions
0
votes
1
answer
20
Regular Language
asked
Aug 12
in
Theory of Computation
by
jatinkumar
(
219
points)

68
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
0
votes
1
answer
21
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
in
Theory of Computation
by
Sindhu Bandaru
(
17
points)

41
views
regularexpressions
0
votes
1
answer
22
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
in
Theory of Computation
by
Sindhu Bandaru
(
17
points)

51
views
regularexpressions
0
votes
2
answers
23
Regular expression
Is a*b* + b*a* = ( a + b)* ______
asked
Jul 31
in
Theory of Computation
by
Ajaaz
(
21
points)

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

52
views
#
regularexpressions
0
votes
1
answer
25
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
in
Theory of Computation
by
Rahul_Rathod_
(
381
points)

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

70
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
2
answers
27
Doubt Regular Language and regular expressions
asked
Jul 16
in
Theory of Computation
by
abhiram144
(
51
points)

91
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
0
votes
1
answer
28
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
in
Theory of Computation
by
Ashish Roy 1
(
35
points)

91
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
29
regular expressions
asked
Jul 8
in
Theory of Computation
by
once_2019
(
341
points)

97
views
theoryofcomputation
regularexpressions
Page:
1
2
3
4
5
6
...
12
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
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Digital Logic GO Classroom
Follow @csegate
Gatecse
Recent questions tagged regularexpressions
Recent Blog Comments
You are posting a question as a blog, go to...
@Swaraj i got 74.22 %
@sanjay sharma , my gmail id ...
@sanjay sharma my mail id is
[email protected]
yes btech (cs) are eligible and to get question...
39,619
questions
46,721
answers
140,297
comments
58,015
users