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
For even no a's RE (b*ab*ab*)* + b* correct or (b*ab*ab*)*.b* or both are equal
dyadav335
asked
in
Theory of Computation
Aug 14, 2017
edited
Aug 14, 2017
by
dyadav335
2,375
views
1
vote
1
vote
For even no a's RE over {a,b}
1) (b*ab*ab*)* + b*
2) (b*ab*ab*)*.b*
3) both are equal?
which one is correct?
theory-of-computation
finite-automata
regular-expression
dyadav335
asked
in
Theory of Computation
Aug 14, 2017
edited
Aug 14, 2017
by
dyadav335
by
dyadav335
2.4k
views
answer
comment
Follow
share this
share
4 Comments
Show 4 previous comments
by
Shubhanshu
commented
Aug 14, 2017
reply
Follow
share this
both are same and can be used for generating even no of a's.
1
1
by
AnilGoudar
commented
Aug 15, 2017
reply
Follow
share this
Yes Both are same, accepts the even number of a's but the second RE also tries to accept of any number of b's due to concatenation.
Sry fr the wrong ans
0
0
by
Sumit Singh Chauhan
commented
Aug 15, 2018
reply
Follow
share this
Both are same. multiple expression are possible for any given language.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
3
votes
3
votes
$(b^*ab^*ab^*)^*+b^* \equiv (b^*ab^*ab^*)^*b^* \equiv b^*(b^*ab^*ab^*)^* \equiv b^*(ab^*ab^*)^* \equiv (b^*ab^*a)^*b^*$
Praveen Saini
answered
Aug 14, 2017
by
Praveen Saini
comment
Follow
share this
0 Comments
Please
log in
or
register
to add a comment.
← Previous
Next →
← Previous in category
Next in category →
Related questions
1
vote
1
vote
1
answer
1
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
2,090
views
Write regular expression to denote a language L a) String which begin or end with either 00 or 11. b) The set of all strings, when viewed as binary representation of integers, that are divisible by 2. c) The set of all strings containing 00. d) String not containing the substring 110.
M_Umair_Khan42900
asked
in
Theory of Computation
Dec 29, 2022
by
M_Umair_Khan42900
2.1k
views
theory-of-computation
regular-expression
finite-automata
pushdown-automata
minimal-state-automata
computer
0
votes
0
votes
0
answers
2
Talha Riaz
asked
in
Theory of Computation
Mar 23
27
views
THEORY OF AUTOMATA ASSIGNMENT # 1 1. Write regular expressions and draw NFA for the following languages over the alphabet Σ = {a, b}: a. All strings that do not end with aa. b. All strings that contain an even number of b’s c. All strings that contain atleast two a’s or exactly two b’s d. All strings that ends with double letters (aa or bb) e. All strings that does not ends with double letter.(can end with ab or ba)
Talha Riaz
asked
in
Theory of Computation
Mar 23
by
Talha Riaz
27
views
1
vote
1
vote
1
answer
3
Purple
asked
in
Theory of Computation
Jan 28, 2016
14,716
views
Regular expression for all strings starts with ab and ends with bba is.
Regular expression for all strings starts with ab and ends with bba is. a) aba*b*bba b) ab(ab)*bba c) ab(a+b)*bba d) All of the mentioned Doubt: starting with 'ab' and ending with 'bba', so 'abba' should also be accepted right?
Purple
asked
in
Theory of Computation
Jan 28, 2016
by
Purple
14.7k
views
regular-expression
theory-of-computation
finite-automata
2
votes
2
votes
1
answer
4
Garrett McClure
asked
in
Theory of Computation
Oct 3, 2017
499
views
Theory of Computation - Show that an algorithm exists for determining if L contains any strings of even length.
Garrett McClure
asked
in
Theory of Computation
Oct 3, 2017
by
Garrett McClure
499
views
theory-of-computation
finite-automata
regular-language
regular-expression
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy