The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
88 views

Are regular expressions (a+b)* and (a*b*)* over alphabet set {a,b} same?

If not, which strings are acceptable in one and not in other... 

asked in Theory of Computation by (103 points) | 88 views
Both are same
$(a+b)^{*}\equiv (a^{*}+b^{*})^{*}\equiv (a^{*}+b)^{*}\equiv (a+b^{*})^{*}\equiv (a^{*}b^{*})^{*}\equiv(b^{*}a^{*})^{*}$

2 Answers

+2 votes

Hence Both are same and produces same set of output set for the given input. 

(DO UPVOTE IT IF YOU'LL LIKE IT) 

answered by (203 points)
edited by
Good answer. But never request for upvotes. You might feel happy for a short time, but you should realize that upvotes does not mean much. Sab Moh - Maya hai.
Then let me be happy for that short time... I don't have any problem with it.
0 votes
BOth are same and  both are accepting any combination of a and b.
answered by Loyal (3.1k points)


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

29,157 questions
36,984 answers
92,154 comments
34,823 users