Super-stationary set, subword problem and the complexity
type: Item
instance of: scholarly article
title: Super-stationary set, subword problem and the complexity
zbMATH Open document ID: 1217.68173
author: Teturo Kamae
author: Hui Rao
author: Bo Tan
author: Yu-Mei Xue
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5644959
zbMATH Keywords: uniform set
zbMATH Keywords: super-stationary set
zbMATH Keywords: complexity
zbMATH Keywords: super-subword
MaRDI profile type: Publication
full work available at URL: j.disc.2009.02.001
OpenAlex ID: W2106784380
cites work: Uniform sets and complexity
cites work: Language structure of pattern Sturmian words
cites work: Sequence entropy and the maximal pattern complexity of infinite words
cites work: Maximal pattern complexity for discrete systems
DOI: 10.1016/J.DISC.2009.02.001
description: scientific article; zbMATH DE number 5644959