Finitely generated sofic systems
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Information Processing Letters
Combinatorics on traces
An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
On the computational power of dynamical systems and hybrid systems
Theoretical Computer Science - Special issue on universal machines and computations
On topological dynamics of Turing machines
Theoretical Computer Science
Partial commutation and traces
Handbook of formal languages, vol. 3
Analog computation with dynamical systems
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
A new kind of science
The Book of Traces
Theory of Codes
Infinite Traces and Symbolic Dynamics
Theory of Computing Systems
Symbolic dynamics, flower automata and infinite traces
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
| Hi-index | 0.00 |
We study interrelations between symbolic descriptions of concurrently evolving systems and underlying sequential dynamics. The basic framework for this research is formulated on the background of the theory of traces. We focus our interests on minimal shifts and t-shifts generated by them, that is shifts defined in the space of infinite real traces. We show that sets of infinite real traces generated by minimal shifts are always closed and, under some conditions, are also t-shifts. Additional discussion for the case of small alphabets (containing at most four letters) is also provided.