On complexity functions of infinite words associated with generalized Dyck languages
From MaRDI portal
Publication:954986
DOI10.1016/j.tcs.2008.05.015zbMath1152.68030OpenAlexW1976686489MaRDI QIDQ954986
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.015
Related Items (3)
Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ Representing real numbers in a generalized numeration system ⋮ On the complexity of a family of \(k\)-context-free sequences
Cites Work
- On the regular structure of prefix rewriting
- The theory of ends, pushdown automata, and second-order logic
- Complexity and special factors
- Complexity of sequences and dynamical systems
- On the complexity of infinite sequences
- On infinite transition graphs having a decidable monadic theory
- On the complexity of infinite words generated by countable \(q\)-automata
- Arithmetics properties of substitutions and infinite automata
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Drunken man infinite words complexity
- Automatic Sequences
- Substitutions par des motifs en dimension 1
- Uniform tag sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On complexity functions of infinite words associated with generalized Dyck languages
