RULE 6-10
From the previous rules, the following rules can be derived:
RULE 6: Xn + Xm = Xn, if n > m
RULE 6: Xn + Xm = Xm, if m > n
RULE 7: XnXm = Xnm
RULE 8: XnX* = X*Xn = X*
RULE 9: XmX+ = X+Xn =X+
RULE 10: X*X* = X+X* = X+
RULES 11-16
RULE 11: 1 + 1 = 1
RULE 12: 1X = X1 = X
Follwing or preceding a set of paths by a path of zero length does not change the test
RULE 13: 1n = 1* = 1+ =1
It doesn't have any effect even though, how often you traverse a path of zero length, it is a path of zero length
RULE 14: 1+ + 1 = 1* = 1
thus null set of paths is denoted by the numeral 0. It obeys the following rules:
RULE 15: X + 0 = 0 + X = X
RULE 16: 0X = X0 =0
There won't be any paths, if you block the paths of a graph by agraph that has no paths
From the previous rules, the following rules can be derived:
RULE 6: Xn + Xm = Xn, if n > m
RULE 6: Xn + Xm = Xm, if m > n
RULE 7: XnXm = Xnm
RULE 8: XnX* = X*Xn = X*
RULE 9: XmX+ = X+Xn =X+
RULE 10: X*X* = X+X* = X+
RULES 11-16
RULE 11: 1 + 1 = 1
RULE 12: 1X = X1 = X
Follwing or preceding a set of paths by a path of zero length does not change the test
RULE 13: 1n = 1* = 1+ =1
It doesn't have any effect even though, how often you traverse a path of zero length, it is a path of zero length
RULE 14: 1+ + 1 = 1* = 1
thus null set of paths is denoted by the numeral 0. It obeys the following rules:
RULE 15: X + 0 = 0 + X = X
RULE 16: 0X = X0 =0
There won't be any paths, if you block the paths of a graph by agraph that has no paths
0 comments:
Post a Comment