Cost and dimension of words of zero topological entropy
From MaRDI portal
Publication:3299253
Abstract: Let denote the free monoid generated by a finite nonempty set In this paper we introduce a new measure of complexity of languages defined in terms of the semigroup structure on For each we define its {it cost} as the infimum of all real numbers for which there exist a language with and a positive integer with We also define the {it cost dimension} as the infimum of the set of all positive integers such that for some language with We are primarily interested in languages given by the set of factors of an infinite word of zero topological entropy, in which case We establish the following characterisation of words of linear factor complexity: Let and Fac be the set of factors of Then if and only and In other words, if and only if Fac for some language of bounded complexity (meaning In general the cost of a language reflects deeply the underlying combinatorial structure induced by the semigroup structure on For example, in contrast to the above characterisation of languages generated by words of sub-linear complexity, there exist non factorial languages of complexity (and hence of cost equal to and of cost dimension In this paper we investigate the cost and cost dimension of languages defined by infinite words of zero topological entropy.
Recommendations
Cites work
- scientific article; zbMATH DE number 5707089 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- Automatic Sequences
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Subword complexity and decomposition of the set of factors
This page was built for publication: Cost and dimension of words of zero topological entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299253)