Comparing Complexity Functions of a Language and Its Extendable Part
From MaRDI portal
Publication:3526422
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
- scientific article; zbMATH DE number 6004833 (Why is no real title available?)
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3978429 (Why is no real title available?)
- A limit theorem for set of subwords in deterministic TOL laguages
- Enumeration of irreducible binary words
- On intermediate factorial languages
- On the structure of the counting function of sparse context-free languages.
- Repetition-free words
- Symbolic Dynamics
Cited in
(10)- Growth of power-free languages over large alphabets
- Growth properties of power-free languages
- Two-Sided Bounds for the Growth Rates of Power-Free Languages
- On the growth rates of complexity of threshold languages
- Growth rates of complexity of power-free languages
- On Abelian repetition threshold
- A new hierarchy for automaton semigroups
- Subword complexity and power avoidance
- Avoiding square-free words on free groups
- On Pnsiot words avoiding 3-repetitions
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)
