Arithmetical complexity of symmetric D0L words.
type: Item
instance of: scholarly article
title: Arithmetical complexity of symmetric D0L words.
zbMATH Open document ID: 1070.68068
DOI: 10.1016/S0304-3975(03)00345-1
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2056814
zbMATH Keywords: Arithmetical complexity
zbMATH Keywords: Symmetric D0L word
zbMATH Keywords: D0L word
zbMATH Keywords: Symmetric morphism
author: Anna Frid
MaRDI profile type: Publication
cites work: Automatic Sequences
cites work: Subword complexities of various classes of deterministic developmental languages without interactions
cites work: Complexity of sequences and dynamical systems
cites work: Q3814828
cites work: Sequence entropy and the maximal pattern complexity of infinite words
cites work: Q5803348
cites work: Q3853827
cites work: Q3659988
cites work: Modified complexity and *-Sturmian word
cites work: Q4738292
Recommended article: ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS
Recommended article: On the arithmetical complexity of Sturmian words
Recommended article: Q3814828
Recommended article: Q4784598
Recommended article: Q4366995
Recommended article: Q5445407
Recommended article: A lower bound for the arithmetical complexity of Sturmian words
Recommended article: Q4330626
Recommended article: ON THE COMPUTATION OF ARNOLD COMPLEXITY OF LENGTH 2n BINARY WORDS
Recommended article: Symbolic analysis of finite words: the complexity function
description: scientific article; zbMATH DE number 2056814