On complexity functions of infinite words associated with generalized Dyck languages
type: Item
instance of: scholarly article
title: On complexity functions of infinite words associated with generalized Dyck languages
zbMATH Open document ID: 1152.68030
author: Marion Le Gonidec
published in: Theoretical Computer Science
publication date: 2008-11-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5368323
zbMATH Keywords: infinite words
zbMATH Keywords: countable automata
zbMATH Keywords: Dyck language
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.05.015
OpenAlex ID: W1976686489
cites work: On the complexity of algebraic numbers. I: Expansions in integer bases
cites work: On the complexity of infinite sequences
cites work: Automatic Sequences
cites work: Q5486009
cites work: Complexity and special factors
cites work: On the regular structure of prefix rewriting
cites work: On infinite transition graphs having a decidable monadic theory
cites work: Uniform tag sequences
cites work: Q5551165
cites work: Complexity of sequences and dynamical systems
cites work: Q3549563
cites work: Q4449875
cites work: On the complexity of infinite words generated by countable \(q\)-automata
cites work: Drunken man infinite words complexity
cites work: Arithmetics properties of substitutions and infinite automata
cites work: The theory of ends, pushdown automata, and second-order logic
cites work: Complexité des facteurs des mots infinis engendrés par morphismes itérés
cites work: Substitutions par des motifs en dimension 1
cites work: Q5317419
cites work: Q4737901
cites work: Q3741080
DOI: 10.1016/J.TCS.2008.05.015
Recommended article: Q5384332
Recommended article: A note on the complexity of \(C^{\infty }\)-words
Recommended article: On a generalization of abelian equivalence and complexity of infinite words
Recommended article: Q4366995
Recommended article: Q3104341
Recommended article: On the minimal complexity of infinite words
Recommended article: On a class of infinite words with affine factor complexity
Recommended article: Bounds on the Kolmogorov Complexity Function for Infinite Words
Recommended article: On Abelian and Additive Complexity in Infinite Words
description: scientific article; zbMATH DE number 5368323