Question: Let ri, r 2, and r3 be three regular expressions. Show that the language associated with (r, + r 2)r 3 is the same, as
Let ri, r 2, and r3 be three regular expressions. Show that the language associated with (r, + r 2)r 3 is the same, as the language associated with rjr 3 + r2r 3. Show that r1 (r 2 + r 3) is equivalent to r1r2 + r jr3 . This will be the same as "proving a distributive law" for regular expressions.
Step by Step Solution
3.46 Rating (156 Votes )
There are 3 Steps involved in it
r1 r2r3 The first expression can be either r1 or r2 The ... View full answer
Get step-by-step solutions from verified subject matter experts
