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 23
82
views
0
votes
0
votes
is a(ba)*=(ab)*a?
theory-of-computation
regular-expression
finite-automata
nbhatt
asked
in
Theory of Computation
Sep 23
by
nbhatt
82
views
answer
comment
Follow
share this
share
1 comment
by
Shaik Masthan
commented
Sep 23
reply
Follow
share this
Yes…
Expand both sides , then you will get
abababababa....a
this can be divide as a(ba)* or (ab)*a
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
2
votes
2
votes
Yes ! it is starting and ending with a.
and both contains same strings.
Pranavpurkar
answered
Sep 23
by
Pranavpurkar
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
1
vote
1
vote
Both are deriving odd length palindrome string and both are equal
kumar123
answered
6 days
ago
by
kumar123
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Related questions
0
votes
0
votes
0
answers
1
nbhatt
asked
in
Theory of Computation
Sep 21
58
views
Regular expression
Can we simplify a*+a*b(d+ca*b)*ca* ? Where a,b,c,d are regular expression.
nbhatt
asked
in
Theory of Computation
Sep 21
by
nbhatt
58
views
theory-of-computation
finite-automata
regular-expression
0
votes
0
votes
1
answer
2
nbhatt
asked
in
Theory of Computation
Sep 21
57
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
57
views
theory-of-computation
regular-expression
finite-automata
1
vote
1
vote
3
answers
3
nbhatt
asked
in
Theory of Computation
Sep 15
198
views
Regular expression
Is (a+ab*b)* and (ab*)* same or not?
nbhatt
asked
in
Theory of Computation
Sep 15
by
nbhatt
198
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,811
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent Blog Comments
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy