Infinite traces and symbolic dynamics -- the minimal shift case (Q2882381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Infinite traces and symbolic dynamics -- the minimal shift case |
scientific article; zbMATH DE number 6030469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Infinite traces and symbolic dynamics -- the minimal shift case |
scientific article; zbMATH DE number 6030469 |
Statements
4 May 2012
0 references
word
0 references
trace
0 references
shift
0 references
shift on traces
0 references
minimal shift
0 references
0 references
0.8719389
0 references
0.86451983
0 references
0 references
0.8540811
0 references
0.85058546
0 references
0 references
Infinite traces and symbolic dynamics -- the minimal shift case (English)
0 references
The paper studies relationships between symbolic descriptions of concurrently evolving systems and the underlying sequential dynamics. The basic framework for this research is formulated within the theory of traces. Traces are a language-theoretic way to capture concurrent computations through identifying words which differ only by the order of independent, or concurrent, actions. The paper is concerned with the minimal shifts and t-shifts generated by them, that is, shifts defined in the space of infinite real traces. It is shown that sets of infinite real traces generated by minimal shifts are always closed and that the same holds, under some conditions, also for t-shifts. The paper discusses in more detail the case of small alphabets containing at most four letters.
0 references
