The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
From MaRDI portal
Publication:6543057
DOI10.1016/J.JCTA.2024.105904MaRDI QIDQ6543057
Publication date: 24 May 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Theory of computing (68Qxx) Conference proceedings and collections of articles (00Bxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- An algorithm for enumerating all infinite repetitions in a D0L-system
- On critical exponents in fixed points of non-erasing morphisms
- Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
- Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen.
- Isabelle/HOL. A proof assistant for higher-order logic
- Characterization of circular D0L-systems
- Subword complexity and power avoidance
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Repetition of subwords in DOL languages
- On Subword Complexity of Morphic Sequences
- Majoration explicite de l'ordre maximum d'un élément du groupe symétrique
- If a DOL language is k-power free then it is circular
- Automatic sequences of rank two
- Factor complexity
- Formalization of Basic Combinatorics on Words
This page was built for publication: The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6543057)
