This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Ù§ y Îµ F2} If M1 has 4 states and M2 has 3 states then we will need at most 12 states in M3 to keep track of all combinations of states. We can think of the combinations as ordered pairs. To find a transition of the machine that results from A U B you must run both machines on the input and the resulting state is the concatenation of the two resulting states. Example: Start State (S1, T1) Q3 = {(S1, T1), (S1, T2), (S1, T3), (S2, T1), (S2, T2), (S2, T3)} Î£ = (0,1) Î´3 = 1 S1,T1 S1,T2 S2,T1 S1,T2 S1,T3 S2,T2 S1,T3 S1,T1 S2,T3 S2,T1 S2,T2 S1,T1 S2,T2 S2,T3 S1,T2 S2,T3 S2,T1 S1T3 Finish State Set {(S1,T1), (S1,T2), (S1,T3), (S2,T1)}...
View
Full Document
 Spring '08
 Staff
 Cartesian product, Ordered pair, Regular expression, Regular language, regular operations, Ariel De Prada

Click to edit the document details