Symbolic dynamics, flower automata and infinite traces

Authors:
Wit Foryś;Piotr Oprocha;Slawomir Bakalarski
Affiliations:
Jagiellonian University, Institute of Computer Science, Kraków, Poland;Departamento de Matem´aticas Universidad de Murcia Campus de Espinardo, Murcia, Spain and Faculty of Applied Mathematics, AGH University of Science and Technology, Kraków, Poland;Jagiellonian University, Institute of Computer Science, Kraków, Poland
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 8
Cited 0

Finitely generated sofic systems

Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
A metric for traces

Information Processing Letters
Combinatorics on traces

Combinatorics on traces
The Book of Traces

The Book of Traces
Theory of Codes

Theory of Codes
Trace Theory and the Specification of Concurrent Systems

The Analysis of Concurrent Systems
Infinite Traces and Symbolic Dynamics

Theory of Computing Systems
Infinite Traces and Symbolic Dynamics - the Minimal Shift Case

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Considering a finite alphabet as a set of allowed instructions, we can identify finite words with basic actions or programs. Hence infinite paths on a flower automaton can represent order in which these programs are executed and a flower shift related with it represents list of instructions to be executed at some mid-point of the computation. Each such list could be converted into an infinite real trace when an additional information is given, namely which instructions can be executed simultaneously (so that way we obtain a schedule for a process of parallel computation). In this paper we investigate when obtained in such a way objects (sets of infinite real traces) are well defined from the dynamical point of view and to what extent they share properties of underlying flower shifts.