Pages that link to "Item:Q1221635"
From MaRDI portal
The following pages link to Subword complexities of various classes of deterministic developmental languages without interactions (Q1221635):
Displaying 39 items.
- New second-preimage attacks on hash functions (Q321303) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Relations on words (Q505060) (← links)
- Sequences of linear arithmetical complexity (Q557917) (← links)
- Some improvements of the \(S\)-adic conjecture (Q651048) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- Entropy rates and finite-state dimension (Q817815) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- On subword complexity functions (Q1057070) (← links)
- On the subword complexity of square-free DOL languages (Q1162365) (← links)
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem (Q1258182) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- On generalized DT0L systems and their fixed points (Q1342236) (← links)
- Transcendence of numbers with a low complexity expansion (Q1377590) (← links)
- Arithmetical complexity of symmetric D0L words. (Q1426472) (← links)
- On a possible classification of real-time constructed sequences (Q1824399) (← links)
- Hierarchie et fermeture de certaines classes de tag-systèmes (Q1837537) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- On the complexity of infinite words generated by countable \(q\)-automata (Q2372782) (← links)
- On the asymptotic abelian complexity of morphic words (Q2406541) (← links)
- On the subword complexity of Thue-Morse polynomial extractions (Q2465648) (← links)
- Invariant measures for the subshifts arising from non-primitive substitutions (Q2479626) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Subword Complexity and Decomposition of the Set of Factors (Q2922010) (← links)
- (Q3959451) (← links)
- Developmental systems with fragmentation (Q4111101) (← links)
- Binary self-adding sequences and languages<sup>1</sup> (Q4332450) (← links)
- On the power of periodic iteration of morphisms (Q4630286) (← links)
- Production en temps réel et complexité de structure de suites infinies (Q4730778) (← links)
- On the Complexity of the Generalized Fibonacci Words (Q5088662) (← links)
- Iterative devices generating infinite words (Q5096808) (← links)
- On a group theoretic generalization of the Morse-Hedlund theorem (Q5270140) (← links)
- A characterization of words of linear complexity (Q5384833) (← links)
- A periodicity property of iterated morphisms (Q5441548) (← links)
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS (Q5483459) (← links)
- Toeplitz words, generalized periodicity and periodically iterated morphisms (Q6085713) (← links)
