Comparing Complexity Functions of a Language and Its Extendable Part
From MaRDI portal
Publication:3526422
DOI10.1051/ITA:2008021zbMATH Open1149.68055OpenAlexW2166930138MaRDI QIDQ3526422FDOQ3526422
Authors: Arseny M. Shur 
Publication date: 25 September 2008
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92893
Recommendations
- Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
- Factorial Languages of Low Combinatorial Complexity
- On complexity functions of infinite words associated with generalized Dyck languages
- On possible growths of Toeplitz languages
- Periodic and Sturmian languages
Cites Work
- Title not available (Why is that?)
- On the structure of the counting function of sparse context-free languages.
- Repetition-free words
- Enumeration of irreducible binary words
- Title not available (Why is that?)
- Title not available (Why is that?)
- A limit theorem for set of subwords in deterministic TOL laguages
- Symbolic Dynamics
- On intermediate factorial languages
Cited In (10)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- Growth rates of complexity of power-free languages
- A new hierarchy for automaton semigroups
- Subword complexity and power avoidance
- On the growth rates of complexity of threshold languages
- Growth properties of power-free languages
- Avoiding square-free words on free groups
- On Pnsiot words avoiding 3-repetitions
- Growth of power-free languages over large alphabets
- On Abelian repetition threshold
This page was built for publication: Comparing Complexity Functions of a Language and Its Extendable Part
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526422)
