gem-graph
/
Gem-graph
3
0
Fork 0
Code Issues 22 Pull Requests Packages Projects Releases Wiki Activity

Definitions Rationale Design

This commit is contained in:
Jean Sirmai 2021-04-01 12:33:35 +00:00
parent d9819dda60
commit 7d047fc564
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@ -25,7 +25,7 @@
#### 5. an automaton, i.e. a set of states and transitions can rewrite this space #### 5. an automaton, i.e. a set of states and transitions can rewrite this space
#### 6. ***states*** can represent ***space*** #### 6. ***states*** can represent ***space***
- here, **space** can be understand as **a representation or approximation of a real 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*** #### 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 #### 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. - 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.