Subword complexities of various classes of deterministic developmental languages without interactions
From MaRDI portal
Publication:1221635
DOI10.1016/0304-3975(75)90012-2zbMath0316.68043OpenAlexW2005768337MaRDI QIDQ1221635
Publication date: 1975
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16407
Related Items (39)
On the joint subword complexity of automatic sequences ⋮ On the complexity of infinite words generated by countable \(q\)-automata ⋮ On generalized DT0L systems and their fixed points ⋮ Computing abelian complexity of binary uniform morphic words ⋮ New second-preimage attacks on hash functions ⋮ Subword Complexity and Decomposition of the Set of Factors ⋮ Logarithmic equal-letter runs for BWT of purely morphic words ⋮ Transcendence of numbers with a low complexity expansion ⋮ On the asymptotic abelian complexity of morphic words ⋮ On the Complexity of the Generalized Fibonacci Words ⋮ Iterative devices generating infinite words ⋮ Binary self-adding sequences and languages1 ⋮ On the subword complexity of square-free DOL languages ⋮ Some improvements of the \(S\)-adic conjecture ⋮ Arithmetical complexity of symmetric D0L words. ⋮ A characterization of words of linear complexity ⋮ On the power of periodic iteration of morphisms ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ On the subword complexity of Thue-Morse polynomial extractions ⋮ Relations on words ⋮ Toeplitz words, generalized periodicity and periodically iterated morphisms ⋮ Developmental systems with fragmentation ⋮ Unnamed Item ⋮ Invariant measures for the subshifts arising from non-primitive substitutions ⋮ Sequences of linear arithmetical complexity ⋮ A periodicity property of iterated morphisms ⋮ On the least number of palindromes in two-dimensional words ⋮ Elementary homomorphisms and a solution of the DOL sequence equivalence problem ⋮ SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS ⋮ On the complexity of a family of \(k\)-context-free sequences ⋮ On a possible classification of real-time constructed sequences ⋮ Production en temps réel et complexité de structure de suites infinies ⋮ Hierarchie et fermeture de certaines classes de tag-systèmes ⋮ A propos d'une conjecture de F. Dejean sur les répétitions dans les mots ⋮ On subword complexity functions ⋮ Palindrome complexity. ⋮ On D0L systems with immigration ⋮ On a group theoretic generalization of the Morse-Hedlund theorem ⋮ Entropy rates and finite-state dimension
Cites Work
- A limit theorem for set of subwords in deterministic TOL laguages
- Development systems with locally catenative formulas
- Characterization of unary developmental languages
- The length sets of D0L languages are uniformly bounded
- DOL sequences
- Description of developmental languages using recurrence systems
- Integral sequential word functions and growth equivalence of lindenmayer systems
- On 0L-Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subword complexities of various classes of deterministic developmental languages without interactions
