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
1
answer
1
Regular expr
from an initial state to remaining states are parallel , what is RE for above FSM??
asked
Dec 3, 2018
in
Theory of Computation
by
Hira Thakur
Boss
(
14.7k
points)

64
views
regularexpressions
0
votes
1
answer
2
MadeEasy Test Series: Theory Of Computation  Regular Expressions
$\Sigma ^{*}  {\left \{ \epsilon \right \}} = \Sigma ^{+} $ $L^{*}  {\left \{ \epsilon \right \}} = L^{+}$ Which of the above is always true ?
asked
Dec 2, 2018
in
Theory of Computation
by
jatin khachane 1
Loyal
(
7.3k
points)

150
views
madeeasytestseries
theoryofcomputation
regularexpressions
–1
vote
1
answer
3
Ace bits and bytes
Is $(aa)^*$ +a$(aa)^*$ = a*?
asked
Nov 25, 2018
in
Theory of Computation
by
suniljha
(
279
points)

88
views
regularexpressions
0
votes
0
answers
4
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, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

71
views
theoryofcomputation
finiteautomata
regularexpressions
regularlanguages
+1
vote
1
answer
5
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
asked
Nov 6, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

278
views
theoryofcomputation
minimalstateautomata
regularexpressions
finiteautomata
nfa
0
votes
0
answers
6
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, 2018
in
Theory of Computation
by
Swapnil Naik
Active
(
3.1k
points)

140
views
theoryofcomputation
regularexpressions
+1
vote
2
answers
7
made easy workbook
asked
Oct 22, 2018
in
Theory of Computation
by
Chetan28kumar
(
143
points)

104
views
regularexpressions
0
votes
1
answer
8
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, 2018
in
Theory of Computation
by
abhishek1995_cse
(
111
points)

71
views
finiteautomata
regularexpressions
0
votes
0
answers
9
Finite Automata
asked
Oct 18, 2018
in
Theory of Computation
by
Sambhrant Maurya
Active
(
3.5k
points)

82
views
finiteautomata
theoryofcomputation
minimalstateautomata
regularexpressions
0
votes
0
answers
10
To test if the given language is regular.
There are two sources on YouTube giving different answers for the same expression.I am confused. Is the given expressions wxwr  w,x $\in$(0,1)+ I think this is regular because this can be reduced to ending with 00 or 01 or 10 or 11 wwrx  w,x $\in$(0,1)+ I think this is regular because it can reduced to starting with 0 or 1
asked
Oct 16, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

127
views
regularexpressions
regularlanguages
finiteautomata
theoryofcomputation
gate2019preparation
0
votes
0
answers
11
Can a^p where p is a prime number be an NFA?
Let l={ (ap )*  p is a prime number} and $\sum$={a}.The minimum number of states in NFA which can accept this language. This is a question from a test series,I just want to know if the question is valid as I feel raised to prime number will not be regular,correct me if I am wrong.Not asking for solution to the question but if the question is valid.
asked
Oct 16, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

467
views
theoryofcomputation
finiteautomata
nfa
#dfa
regularlanguages
regularexpressions
0
votes
0
answers
12
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, 2018
in
Theory of Computation
by
Sambhrant Maurya
Active
(
3.5k
points)

89
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
1
answer
13
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
asked
Oct 10, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

131
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
expression
0
votes
0
answers
14
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, 2018
in
Theory of Computation
by
sripo
Active
(
2.4k
points)

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

94
views
regularexpressions
0
votes
0
answers
16
ullman chapter regular expressions and languages exercise 3.1
Not able to construct the regular expressions for the statements
asked
Oct 7, 2018
in
Theory of Computation
by
Rhythm
(
195
points)

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

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

67
views
regularexpressions
0
votes
2
answers
19
Regular Languages
Why is WXWR a regular language but XWWR is not? (X,W ϵ (0,1)+)
asked
Oct 1, 2018
in
Theory of Computation
by
Sambhrant Maurya
Active
(
3.5k
points)

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

67
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
0
votes
2
answers
21
Peter Linz Edition 4 Exercise 3.1 Question 18 (Page No. 76)
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, 2018
in
Theory of Computation
by
Karan Dodwani 1
(
183
points)

112
views
regularlanguages
regularexpressions
peterlinz
0
votes
2
answers
22
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, 2018
in
Theory of Computation
by
Ashish Roy 1
(
167
points)

182
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
0
votes
0
answers
23
ISI2016PCBCS6
Let L be a regular language over $\{0,1\}$. Define the reverse of the language $L$ to be the language $L^R = \{ w \in \{0,1\}^* \: \: : \: \: \text{ reverse }(w) \in L\}$, where $\text{reverse}(w)$ denotes the string $w$ ... $x$ contains an odd number of $1's$ and $00$ as a substring$\}.$ Construct a regular expression for the language $L$.
asked
Sep 18, 2018
in
Theory of Computation
by
jothee
Veteran
(
105k
points)

13
views
isi2016pcbcs
regularlanguages
regularexpressions
descriptive
+1
vote
1
answer
24
Consider the following regular expression R=(a+b)* (a+b+ε)a
Consider the following regular expression R=(a+b)* (a+b+ε)a which of the following is equivalent to the above a)(a*+b*)+ (aa+ba) b)(ε+a+b*)+ a c)(a+b)+ (a+b+ε)a d)None of these
asked
Sep 15, 2018
in
Theory of Computation
by
Kshitij Hansda
(
123
points)

139
views
regularexpressions
+2
votes
2
answers
25
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, 2018
in
Theory of Computation
by
Na462
Loyal
(
6.9k
points)

129
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
identifyclasslanguage
+1
vote
1
answer
26
Testbook Regular expressions
asked
Sep 13, 2018
in
Theory of Computation
by
Mk Utkarsh
Boss
(
35.7k
points)

108
views
regularexpressions
theoryofcomputation
0
votes
1
answer
27
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, 2018
in
Theory of Computation
by
goluabhinan
(
71
points)

98
views
theoryofcomputation
regularexpressions
finiteautomata
regularlanguages
+1
vote
1
answer
28
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, 2018
in
Theory of Computation
by
Na462
Loyal
(
6.9k
points)

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

78
views
regularexpressions
0
votes
0
answers
30
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, 2018
in
Theory of Computation
by
navya n
(
365
points)

112
views
regularexpressions
testseries
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
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
@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?...
Is IT eligible to apply in ECIL because they only...
@`JEET No brother, I don't have. These points I...
50,645
questions
56,580
answers
195,773
comments
101,777
users