On the periodicity of morphisms on free monoids
From MaRDI portal
Publication:3747748
Recommendations
Cites work
- scientific article; zbMATH DE number 3644504 (Why is no real title available?)
- scientific article; zbMATH DE number 3864525 (Why is no real title available?)
- scientific article; zbMATH DE number 3872709 (Why is no real title available?)
- The decidability of the dol prefix problem
- The equations \(h(w)=w^ n\) in binary alphabets
- The ultimate equivalence problem for DOL systems
Cited in
(41)- Periodicity Problem of Substitutions over Ternary Alphabets
- On the simplification of infinite morphic words
- Morphic congruences and D0L languages
- An algorithm for enumerating all infinite repetitions in a D0L-system
- Periodic endomorphisms of a free monoid
- Iterative algebras.
- The finiteness problem for monoids of morphisms.
- A new proof for the decidability of D0L ultimate periodicity
- Decidability of uniform recurrence of morphic sequences
- Regularity of sets of initial strings of periodic D0L-systems
- scientific article; zbMATH DE number 4131678 (Why is no real title available?)
- Periodicity and ultimate periodicity of D0L systems
- scientific article; zbMATH DE number 826074 (Why is no real title available?)
- Cancellation and periodicity properties of iterated morphisms
- Congruences Associated with Dol-Schemes
- On the subword equivalence problem for morphic words
- Properties of infinite words: recent results
- On D0L power series
- The set of strings mapped into a submonoid by iterates of a morphism
- Asymptotic behaviour of bi-infinite words
- Prefixes of infinite words and ambiguous context-free languages
- Periodicity of morphic words
- Presentations of Schützenberger groups of minimal subshifts.
- Iterative devices generating infinite words
- On D0L systems with immigration
- On D0L and HDT0L sets in monoids
- scientific article; zbMATH DE number 3872709 (Why is no real title available?)
- A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
- Decidability of periodicity for infinite words
- Bounded D0L languages
- Automatic sequences of rank two
- Periodic D0L languages
- If a DOL language is k-power free then it is circular
- On the factors of automatic words
- Quasimorphismes sur le monoïde libre, et substitutions dans les mesures invariantes
- Decidable problems in substitution shifts
- Relations on words
- scientific article; zbMATH DE number 4112045 (Why is no real title available?)
- Coding of substitution dynamical systems as shifts of finite type
- scientific article; zbMATH DE number 1303030 (Why is no real title available?)
- Some non finitely generated monoids of repetition-free endomorphisms.
This page was built for publication: On the periodicity of morphisms on free monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747748)
