Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Regular expression
nbhatt
asked
in
Theory of Computation
Sep 21
edited
Sep 21
by
nbhatt
173
views
0
votes
0
votes
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
theory-of-computation
finite-automata
regular-expression
nbhatt
asked
in
Theory of Computation
Sep 21
edited
Sep 21
by
nbhatt
by
nbhatt
173
views
answer
comment
Follow
share this
share
1 comment
by
Sumit Singh Dhami
commented
Sep 21
reply
Follow
share this
Yes we can. Draw DFA and minimize.
I am getting $(a+bd^*c)^*$
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
3
answers
1
nbhatt
asked
in
Theory of Computation
Sep 23
192
views
Regular expression
is a(ba)*=(ab)*a?
nbhatt
asked
in
Theory of Computation
Sep 23
by
nbhatt
192
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
votes
1
answer
2
nbhatt
asked
in
Theory of Computation
Sep 21
98
views
Regular expression
What will be the regular expression for following fa using recurrence relation method.
nbhatt
asked
in
Theory of Computation
Sep 21
by
nbhatt
98
views
theory-of-computation
regular-expression
finite-automata
2
votes
2
votes
3
answers
3
nbhatt
asked
in
Theory of Computation
Sep 15
266
views
Regular expression
Is (a+ab*b)* and (ab*)* same or not?
nbhatt
asked
in
Theory of Computation
Sep 15
by
nbhatt
266
views
theory-of-computation
regular-expression
finite-automata
0
votes
0
votes
1
answer
4
Ram Swaroop
asked
in
Theory of Computation
Dec 28, 2018
1,832
views
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+€)
Ram Swaroop
asked
in
Theory of Computation
Dec 28, 2018
by
Ram Swaroop
1.8k
views
regular-expression
theory-of-computation
finite-automata
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy