Definitions Rationale Design
This commit is contained in:
parent
d9819dda60
commit
7d047fc564
|
@ -25,7 +25,7 @@
|
|||
#### 5. an automaton, i.e. a set of states and transitions can rewrite this space
|
||||
#### 6. ***states*** can represent ***space***
|
||||
- here, **space** can be understand as **a representation or approximation of a real space**
|
||||
- but a **state** can be a **space** as well as a text or any other set of symbols or writings (ex: tags) that can be drawn in the graph using the same encoding and a **state** can be an association of both.
|
||||
- but a **state** can be a **space** as well as a text or any other set of symbols or writings (ex: tags) that can be drawn in the graph using the same encoding or it can be any association of both.
|
||||
#### 7. transitions are all combinations of ***a single type of elementary transition***
|
||||
#### 8. the coding of static information (states) and dynamic information (transitions) is distinct
|
||||
- the purpose of this restriction is to maintain a strict **homogeneity of the rules** (cf. §7) which is the condition of their automatic management and edition.
|
||||
|
|
Loading…
Reference in New Issue