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
0
votes
0
answers
1
RE for given FA
The correct regular expression for the below mentioned Finite Automata Do we have to have ca* as C is dead state,does dead state be a part of regular expression? The expression I am gettting is c*a(d*+ba*) as C state is dead state hence no need to consider it.Please Correct me.
asked
Nov 6
in
Theory of Computation
by
sripo
Junior
(
755
points)

30
views
theoryofcomputation
finiteautomata
regularexpressions
regularlanguages
+1
vote
1
answer
2
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
asked
Nov 6
in
Theory of Computation
by
sripo
Junior
(
755
points)

40
views
theoryofcomputation
minimalstateautomata
regularexpressions
finiteautomata
nfa
0
votes
0
answers
3
Dfa to regular expression
I tried applying a method where we write equation as state with incoming transition on given dfa  q1 = $\epsilon$ + bq1+bq2 q2 = aq1+aq2 but then able to reach till this conclusion only: q2 = ab*+aq2+abq2b* How to solve further? Here q1 is a start state.
asked
Oct 24
in
Theory of Computation
by
Swapnil Naik
Active
(
2.1k
points)

31
views
theoryofcomputation
regularexpressions
+1
vote
2
answers
4
made easy workbook
asked
Oct 22
in
Theory of Computation
by
Chetan28kumar
(
147
points)

67
views
regularexpressions
0
votes
1
answer
5
Acebook
The minimal finite automata accepting the strings in r=0*1* has ________ states? for DFA its 3 states and for NFA its 2 states which one should i go with?
asked
Oct 21
in
Theory of Computation
by
abhishek1995_cse
(
155
points)

47
views
finiteautomata
regularexpressions
0
votes
0
answers
6
Finite Automata
asked
Oct 18
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
899
points)

52
views
finiteautomata
theoryofcomputation
minimalstateautomata
regularexpressions
0
votes
0
answers
7
To test if the given language is regular.
asked
Oct 16
in
Theory of Computation
by
sripo
Junior
(
755
points)

71
views
regularexpressions
regularlanguages
finiteautomata
theoryofcomputation
gate2019preparation
0
votes
0
answers
8
Can a^p where p is a prime number be an NFA?
asked
Oct 16
in
Theory of Computation
by
sripo
Junior
(
755
points)

72
views
theoryofcomputation
finiteautomata
nfa
#dfa
regularlanguages
regularexpressions
0
votes
0
answers
9
Regular Languages
Which is the equivalent Regular Expression for the following: "Strings in which every group of 3 symbols should contain atleast 1 a." a)[(a+b) (a+b)a]* b) [(a+b) (a+b)a]* [(a+b)(a+b)a]* c)[(ϵ + b + bb)a]* [ ϵ+ b + bb] d) (abb)* (bab)b* (bba)*
asked
Oct 14
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
899
points)

40
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
10
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
asked
Oct 10
in
Theory of Computation
by
sripo
Junior
(
755
points)

57
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
expression
0
votes
0
answers
11
Equivalence of regular expressions
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it just worked for this case?
asked
Oct 10
in
Theory of Computation
by
sripo
Junior
(
755
points)

30
views
regularexpressions
theoryofcomputation
regularlanguages
finiteautomata
+1
vote
1
answer
12
regular exprression
what is the equivalent nfa for the given regular expression? a*b*(ba)*a*
asked
Oct 9
in
Theory of Computation
by
suneetha
(
329
points)

71
views
regularexpressions
0
votes
0
answers
13
ullman chapter regular expressions and languages exercise 3.1
asked
Oct 7
in
Theory of Computation
by
Rhythm
(
33
points)

25
views
regularexpressions
0
votes
2
answers
14
regular ex
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?
asked
Oct 6
in
Theory of Computation
by
suneetha
(
329
points)

42
views
regular
regularexpressions
0
votes
2
answers
15
regular expressions
how can we represent (ab)*ba*(b+a)*aab* in finite automata?
asked
Oct 6
in
Theory of Computation
by
suneetha
(
329
points)

43
views
regularexpressions
0
votes
2
answers
16
Regular Languages
Why is WXWR a regular language but XWWR is not? (X,W ϵ (0,1)+)
asked
Oct 1
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
899
points)

47
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
2
answers
17
Regular Languages
Why is ambn / m,n>=1 a regular language but anbn / n>=1 not?
asked
Oct 1
in
Theory of Computation
by
Sambhrant Maurya
Junior
(
899
points)

45
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
18
Peter Linz
Find regular expressions for the following languages on {a, b}. (a) L = {w : w mod 3 = 0} (b) L = {w : na (w)mod 3 = 0} (c) L = {w : na (w)mod 5 > 0} Also Design DFA for the same.
asked
Sep 27
in
Theory of Computation
by
Karan Dodwani 1
(
63
points)

59
views
regularlanguages
regularexpressions
peterlinz
0
votes
2
answers
19
TOC (Regular expression)
Given two Regular expressions are equal or not ? 1) (1+01*0)* 2) 1*(01*0)* 1* Give proper explanation also.
asked
Sep 27
in
Theory of Computation
by
Ashish Roy 1
(
83
points)

95
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
+1
vote
1
answer
20
Consider the following regular expression R=(a+b)* (a+b+ε)a
asked
Sep 15
in
Theory of Computation
by
Kshitij Hansda
(
99
points)

81
views
regularexpressions
0
votes
0
answers
21
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)

42
views
theoryofcomputation
peterlinz
regularexpressions
finiteautomata
regularlanguages
+2
votes
2
answers
22
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
(
6.9k
points)

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

81
views
regularexpressions
theoryofcomputation
0
votes
1
answer
24
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
(
101
points)

71
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
+1
vote
1
answer
25
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
(
6.9k
points)

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

52
views
regularexpressions
0
votes
0
answers
27
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
(
365
points)

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

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

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

54
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
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
SCREENSHOT
Basic LaTeX guide
IIT Madras Phd
Databases GO Classroom
Happy Birthday Sir Arjun
Follow @csegate
Gatecse
Recent questions tagged regularexpressions
Recent Blog Comments
Sir for final year student who have exam in...
I guess you meant while chasing :) Anyway those...
I'll write a post on how to best...
@Gaurav Go through all the previous yr questions,...
42,619
questions
48,614
answers
155,865
comments
63,855
users