Sofic Tree-Shifts

We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite ranked trees accepted by finite tree automata. We show that, contrary to shifts of infinite sequences, there is no unique reduced deterministic irreducible tree automaton accepting an irreducible...

Full description

Saved in:

Bibliographic Details
Published in:	Theory of computing systems Vol. 53; no. 4; pp. 621 - 644
Main Authors:	Aubrun, Nathalie, Béal, Marie-Pierre
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.11.2013 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Analysis Automation Computer Science Data Structures and Algorithms Delay Design engineering Dynamical systems Invariants Mathematical analysis Studies Symbolism Theory of Computation Trees Symbolic dynamics Tree-shift Tree automata
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!