Infinite words with linear subword complexity
type: Item
instance of: scholarly article
title: Infinite words with linear subword complexity
zbMATH Open document ID: 0682.68083
DOI: 10.1016/0304-3975(89)90046-7
author: Filippo Mignosi
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11A63
Mathematics Subject Classification ID: 11A55
zbMATH DE Number: 4117886
zbMATH Keywords: linear complexity and combinatorial properties
zbMATH Keywords: infinite words
zbMATH Keywords: subword complexity
zbMATH Keywords: sturmian infinite words
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90046-7
OpenAlex ID: W2010717857
cites work: Uniform tag sequences
cites work: Rewriting products of group elements. I
cites work: Sequences with minimal block growth
cites work: Q3310057
cites work: A permutational property of groups
cites work: Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
cites work: On the factors of the Thue-Morse word on three symbols
cites work: A combinatorial theorem on $p$-power-free words and an application to semigroups
cites work: On the subword complexity of DOL languages with a constant distribution
cites work: Q5622446
cites work: Q5772619
cites work: Q3853827
cites work: Q3659988
cites work: Q3754068
cites work: On the Burnside problem for semigroups
cites work: Permutation properties and the Fibonacci semigroup
cites work: An effective bound for groups of linear growth
description: scientific article; zbMATH DE number 4117886