Forbidden words in symbolic dynamics
type: Item
instance of: scholarly article
title: Forbidden words in symbolic dynamics
zbMATH Open document ID: 0965.37014
published in: Advances in Applied Mathematics
publication date: 2000-11-16T00:00:00Z
review text: This paper is devoted to a new topological invariant for symbolic dynamics. One of the classical ways of describing a symbolic dynamical system is by using forbidden words. The authors introduce an equivalence relation \(\simeq\) between functions from \(\mathbb{N}\) to \(\mathbb{N}\). Using forbidden words, the authors prove that any equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. With the help of the new invariant, the authors show that two systems associated to Sturmian words having ``different slope'' are not conjugate.
Mathematics Subject Classification ID: 37B10
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 37C15
zbMATH DE Number: 1531152
zbMATH Keywords: conjugacy
zbMATH Keywords: topological invariant
zbMATH Keywords: symbolic dynamics
zbMATH Keywords: Sturmian words
author: Marie-Pierre Béal
author: Filippo Mignosi
author: Antonio Restivo
author: M. Sciortino
reviewed by: Messoud Efendiev
MaRDI profile type: Publication
OpenAlex ID: W2018446984
cites work: Algorithms for sliding block codes - An application of symbolic dynamics to information theory
cites work: Complexity
cites work: Puissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofique
cites work: Minimal forbidden words and symbolic dynamics
cites work: Q3718171
cites work: The origins of combinatorics on words
cites work: Complexity and special factors
cites work: Automata and forbidden words
cites work: Some combinatorial properties of Sturmian words
cites work: On bispecial factors of the Thue-Morse word
cites work: Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
cites work: Q4079524
cites work: Rank and symbolic complexity
cites work: Finitely presented dynamical systems
cites work: Q4040797
cites work: Q5772619
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Williams's Conjecture is False for Reducible Subshifts
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Q3659988
cites work: Symbolic dynamics and finite automata
cites work: Q3346416
cites work: \(\mathbb{N}\)-rationality of zeta functions
cites work: Q4155837
cites work: Classification of subshifts of finite type
DOI: 10.1006/AAMA.2000.0682
description: scientific article; zbMATH DE number 1531152