Subword complexities of various classes of deterministic developmental languages without interactions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3476618 (Why is no real title available?)
- scientific article; zbMATH DE number 3550202 (Why is no real title available?)
- scientific article; zbMATH DE number 3383530 (Why is no real title available?)
- scientific article; zbMATH DE number 3398797 (Why is no real title available?)
- scientific article; zbMATH DE number 3421926 (Why is no real title available?)
- A limit theorem for set of subwords in deterministic TOL laguages
- Characterization of unary developmental languages
- DOL sequences
- Description of developmental languages using recurrence systems
- Development systems with locally catenative formulas
- Integral sequential word functions and growth equivalence of lindenmayer systems
- On 0L-Languages
- The length sets of D0L languages are uniformly bounded
Cited in
(39)- On the complexity of infinite words generated by countable \(q\)-automata
- On the Complexity of the Generalized Fibonacci Words
- Sequences of linear arithmetical complexity
- On the asymptotic abelian complexity of morphic words
- On the least number of palindromes in two-dimensional words
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Computing abelian complexity of binary uniform morphic words
- Entropy rates and finite-state dimension
- Arithmetical complexity of symmetric D0L words.
- Some improvements of the \(S\)-adic conjecture
- Iterative devices generating infinite words
- On the joint subword complexity of automatic sequences
- Hierarchie et fermeture de certaines classes de tag-systèmes
- Palindrome complexity.
- On subword complexity functions
- Invariant measures for the subshifts arising from non-primitive substitutions
- scientific article; zbMATH DE number 3780589 (Why is no real title available?)
- New second-preimage attacks on hash functions
- On the subword complexity of square-free DOL languages
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- On D0L systems with immigration
- Logarithmic equal-letter runs for BWT of purely morphic words
- Binary self-adding sequences and languages1
- Subword complexity and decomposition of the set of factors
- Transcendence of numbers with a low complexity expansion
- On the complexity of a family of \(k\)-context-free sequences
- Developmental systems with fragmentation
- On the subword complexity of Thue-Morse polynomial extractions
- On generalized DT0L systems and their fixed points
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- On the power of periodic iteration of morphisms
- Relations on words
- On a possible classification of real-time constructed sequences
- A characterization of words of linear complexity
- SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
- A periodicity property of iterated morphisms
- Production en temps réel et complexité de structure de suites infinies
- On a group theoretic generalization of the Morse-Hedlund theorem
This page was built for publication: Subword complexities of various classes of deterministic developmental languages without interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1221635)
