On complexity functions of infinite words associated with generalized Dyck languages
From MaRDI portal
Publication:954986
Recommendations
- scientific article; zbMATH DE number 7069796
- A note on the complexity of \(C^{\infty }\)-words
- On a generalization of abelian equivalence and complexity of infinite words
- scientific article; zbMATH DE number 1091206
- On a new notion of complexity on infinite words
- On the minimal complexity of infinite words
- On a class of infinite words with affine factor complexity
- Bounds on the Kolmogorov complexity function for infinite words
- On abelian and additive complexity in infinite words
Cites work
- scientific article; zbMATH DE number 3976367 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- scientific article; zbMATH DE number 2087217 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- scientific article; zbMATH DE number 3266627 (Why is no real title available?)
- Analytic combinatorics
- Arithmetics properties of substitutions and infinite automata
- Automatic Sequences
- Complexity and special factors
- Complexity of sequences and dynamical systems
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Drunken man infinite words complexity
- On infinite transition graphs having a decidable monadic theory
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the complexity of infinite sequences
- On the complexity of infinite words generated by countable \(q\)-automata
- On the regular structure of prefix rewriting
- Substitutions par des motifs en dimension 1
- The theory of ends, pushdown automata, and second-order logic
- Uniform tag sequences
Cited in
(13)- On the average minimal prefix-length of the generalized semi-Dycklanguage
- On the complexity of a family of \(k\)-context-free sequences
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Drunken man infinite words complexity
- Comparing Complexity Functions of a Language and Its Extendable Part
- Dyck words, pattern avoidance, and automatic sequences
- On the complexity of infinite words generated by countable \(q\)-automata
- Representing real numbers in a generalized numeration system
- Morphisms on infinite alphabets, countable states automata and regular sequences
- The rational index of the Dyck language \(D_ 1^{'*}\)
- scientific article; zbMATH DE number 7559499 (Why is no real title available?)
- scientific article; zbMATH DE number 7069796 (Why is no real title available?)
- Lexicographical Generation of a Generalized Dyck Language
This page was built for publication: On complexity functions of infinite words associated with generalized Dyck languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954986)
