From 7d047fc5647786499c095d8067807a769dd0728a Mon Sep 17 00:00:00 2001 From: Jean Sirmai Date: Thu, 1 Apr 2021 12:33:35 +0000 Subject: [PATCH] Definitions Rationale Design --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index a25b1b3..2f75626 100644 --- a/README.md +++ b/README.md @@ -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.