On complexity functions of infinite words associated with generalized Dyck languages
From MaRDI portal
Publication:954986
DOI10.1016/J.TCS.2008.05.015zbMATH Open1152.68030OpenAlexW1976686489MaRDI QIDQ954986FDOQ954986
Authors: Marion Le Gonidec 
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
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
- Analytic combinatorics
- Automatic Sequences
- Title not available (Why is that?)
- Uniform tag sequences
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Title not available (Why is that?)
- Complexity and special factors
- On the complexity of infinite sequences
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- The theory of ends, pushdown automata, and second-order logic
- Complexity of sequences and dynamical systems
- Title not available (Why is that?)
- Arithmetics properties of substitutions and infinite automata
- On infinite transition graphs having a decidable monadic theory
- On the complexity of infinite words generated by countable \(q\)-automata
- Drunken man infinite words complexity
- Substitutions par des motifs en dimension 1
- On the regular structure of prefix rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- On the complexity of infinite words generated by countable \(q\)-automata
- Title not available (Why is that?)
- The rational index of the Dyck language \(D_ 1^{'*}\)
- Comparing Complexity Functions of a Language and Its Extendable Part
- Title not available (Why is that?)
- Drunken man infinite words complexity
- Representing real numbers in a generalized numeration system
- On the complexity of a family of \(k\)-context-free sequences
- Morphisms on infinite alphabets, countable states automata and regular sequences
- On the average minimal prefix-length of the generalized semi-Dycklanguage
- 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)
