The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
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
Regular Expression
The answer given is none of these !! I think 1’st statement is the correct one, but still want to confirm
asked
1 day
ago
in
Theory of Computation
by
Nandkishor3939
Junior
(
665
points)

27
views
theoryofcomputation
regularexpressions
0
votes
1
answer
2
Practice Question
How to prove that $ (a+b)^*ab(a+b)^*+b^*a^* = (a+b)^*$
asked
3 days
ago
in
Theory of Computation
by
Hardik Maheshwari
(
91
points)

22
views
theoryofcomputation
regularexpressions
regularlanguages
regulargrammar
0
votes
0
answers
3
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$ i am sure that 1st is true but for 2nd take an example so 2nd become false but given that both are true for DFA where i am doing mistake ??
asked
6 days
ago
in
Theory of Computation
by
Gurdeep Saini
Loyal
(
7.6k
points)

24
views
finiteautomata
theoryofcomputation
regularlanguages
regularexpressions
0
votes
0
answers
4
Made Easy test series
asked
Jan 9
in
Theory of Computation
by
Sambhrant Maurya
Active
(
1.2k
points)

41
views
madeeasytestseries
regularlanguages
regularexpressions
+1
vote
0
answers
5
ME_test_series
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 by finding strings which one of the language 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
(
1.6k
points)

79
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
votes
0
answers
6
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
(
1.3k
points)

28
views
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
regularexpressions
0
votes
1
answer
7
Regular Expression Statements
Can anyone explain how S2 is false,I did not understand their logic.
asked
Jan 1
in
Theory of Computation
by
sripo
Active
(
1.3k
points)

49
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
expression
madeeasytestseries
0
votes
1
answer
8
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
Loyal
(
7.6k
points)

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

84
views
regularlanguages
regularexpressions
0
votes
1
answer
10
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
(
15
points)

32
views
regularexpressions
0
votes
1
answer
11
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
(
1.3k
points)

53
views
regularexpressions
theoryofcomputation
finiteautomata
+1
vote
3
answers
12
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
(
2k
points)

120
views
go2019flt1
regularexpressions
0
votes
1
answer
13
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
Junior
(
513
points)

49
views
regularexpressions
0
votes
0
answers
14
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
(
483
points)

60
views
theoryofcomputation
regularexpressions
0
votes
0
answers
15
#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
(
9.4k
points)

47
views
theoryofcomputation
regularlanguages
finiteautomata
regularexpressions
0
votes
1
answer
16
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
(
2.2k
points)

55
views
#dfa
finiteautomata
equivalenceclasses
regularlanguages
regularexpressions
+1
vote
1
answer
17
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
(
437
points)

89
views
contextsensitive
regularlanguages
contextfreelanguage
theoryofcomputation
regularexpressions
+2
votes
1
answer
18
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
(
209
points)

176
views
theoryofcomputation
finiteautomata
regularlanguages
regularexpressions
identifyclasslanguage
0
votes
0
answers
19
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
Active
(
3k
points)

54
views
regularexpressions
0
votes
1
answer
20
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
(
13.8k
points)

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

73
views
regularexpressions
0
votes
0
answers
22
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
(
1.3k
points)

54
views
theoryofcomputation
finiteautomata
regularexpressions
regularlanguages
+1
vote
1
answer
23
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
(
1.3k
points)

97
views
theoryofcomputation
minimalstateautomata
regularexpressions
finiteautomata
nfa
0
votes
0
answers
24
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
(
2.7k
points)

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

83
views
regularexpressions
0
votes
1
answer
26
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
(
159
points)

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

67
views
finiteautomata
theoryofcomputation
minimalstateautomata
regularexpressions
0
votes
0
answers
28
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
(
1.3k
points)

95
views
regularexpressions
regularlanguages
finiteautomata
theoryofcomputation
gate2019preparation
0
votes
0
answers
29
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
(
1.3k
points)

144
views
theoryofcomputation
finiteautomata
nfa
#dfa
regularlanguages
regularexpressions
0
votes
0
answers
30
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
(
1.2k
points)

50
views
theoryofcomputation
regularlanguages
regularexpressions
finiteautomata
Page:
1
2
3
4
5
6
...
13
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
Decidability Slides
How to Revise?
AAI JE IT results out! Adv no 02/2018
Graph Theory Slides for GATECSE
Generating Function Useful Link
Follow @csegate
Gatecse
Recent questions tagged regularexpressions
Recent Blog Comments
@arjun sir along with this are there any other...
Thanks :)
You don't have to be,I know what you are going...
Thank you sir!
46,787
questions
51,234
answers
176,584
comments
66,585
users