Background
Complexity assessment
Binary tree
L-system
Methods
Rewriting rules
Homomorphism and isomorphism
Homomorphism in rewriting rules
Isomorphism on level X in rewriting rules
Class | Homomorphism | Isomorphism-1 | Isomorphism-2 |
---|---|---|---|
1 |
p ↦ Plr
|
p ↦ Plr
|
p ↦ Plr
|
Pl ↦ Llr
| |||
Pr ↦ Rlr
| |||
2 |
PLl ↦ L(1)lr
|
Pl ↦ Llr
|
Pl ↦ Llr
|
PRl ↦ L(1) |
Pr ↦ Rlr
| ||
3 |
PLr ↦ R(2) |
PLl ↦ L(1)lr
|
Pr ↦ Rlr
|
PRr ↦ R(2)lr
| |||
4 |
PLLl ↦ L(3)
PRRl ↦ L(3) |
PLr ↦ R(2) |
PLl ↦ L(1)lr
|
5 |
PLLr ↦ R(4)
PRRr ↦ R(4) |
PRl ↦ L(1) |
PLr ↦ R(2) |
6 |
PRr ↦ R(2)lr
|
PRl ↦ L(1) | |
7 |
PLLl ↦ L(3) |
PRr ↦ R(2)lr
| |
PRRl ↦ L(3) | |||
8 |
PLLr ↦ R(4) |
PLLl ↦ L(3) | |
PRRr ↦ R(4) |
PRRl ↦ L(3) | ||
9 |
PLLr ↦ R(4) | ||
PRRr ↦ R(4) |
Class | Homomorphism | Isomorphism-1 | Isomorphism-2 |
---|---|---|---|
1 |
C
1 ↦ C
1
C
1
|
C
1 ↦ C
2
C
2
|
C
1 ↦ C
2
C
3
|
C
1 ↦ C
2
C
3
| |||
C
1 ↦ C
2
C
3
| |||
2 |
C
2 ↦ C
4
C
5
|
C
2 ↦ C
3
C
4
|
C
2 ↦ C
4
C
5
|
C
2 ↦ null |
C
2 ↦ C
5
C
6
| ||
3 |
C
3 ↦ null |
C
3 ↦ C
7
C
8
|
C
3 ↦ C
6
C
7
|
C
3 ↦ C
4
C
5
| |||
4 |
C
4 ↦ null |
C
4 ↦ null |
C
4 ↦ C
8
C
9
|
C
4 ↦ null | |||
5 |
C
5 ↦ null |
C
5 ↦ null |
C
5 ↦ null |
C
5 ↦ null | |||
6 |
C
6 ↦ C
7
C
8
|
C
6 ↦ null | |
7 |
C
7 ↦ null |
C
7 ↦ C
8
C
9
| |
C
7 ↦ null | |||
8 |
C
8 ↦ null |
C
8 ↦ null | |
C
8 ↦ null |
C
8 ↦ null | ||
9 |
C
9 ↦ null | ||
C
9 ↦ null |