On the periodicity of morphisms on free monoids

DOI10.1051/ITA/1986200100471zbMATH Open0608.68065OpenAlexW34101780MaRDI QIDQ3747748FDOQ3747748

Authors: Tero Harju, Matti Linna 

Publication date: 1986

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92245

Recommendations

• Periodic D0L languages
• scientific article; zbMATH DE number 3872709
• Decidability of periodicity for infinite words
• Periodicity of morphic words
• scientific article; zbMATH DE number 4112045

zbMATH Keywords

primitive wordsD0L systemsfinitely generated free monoidD0L periodicity problemperiodic \(\omega \)-words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• The ultimate equivalence problem for DOL systems
• The decidability of the dol prefix problem
• Title not available (Why is that?)
• The equations \(h(w)=w^ n\) in binary alphabets
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (41)

• Periodic endomorphisms of a free monoid
• Title not available (Why is that?)
• Morphic congruences and D0L languages
• Prefixes of infinite words and ambiguous context-free languages
• Presentations of Schützenberger groups of minimal subshifts.
• Title not available (Why is that?)
• Cancellation and periodicity properties of iterated morphisms
• Iterative devices generating infinite words
• On the simplification of infinite morphic words
• Regularity of sets of initial strings of periodic D0L-systems
• A new proof for the decidability of D0L ultimate periodicity
• Automatic sequences of rank two
• Periodic D0L languages
• Iterative algebras.
• On D0L systems with immigration
• Coding of substitution dynamical systems as shifts of finite type
• Periodicity Problem of Substitutions over Ternary Alphabets
• Properties of infinite words: recent results
• Congruences Associated with Dol-Schemes
• Periodicity of morphic words
• Title not available (Why is that?)
• The set of strings mapped into a submonoid by iterates of a morphism
• Title not available (Why is that?)
• Asymptotic behaviour of bi-infinite words
• Quasimorphismes sur le monoïde libre, et substitutions dans les mesures invariantes
• An algorithm for enumerating all infinite repetitions in a D0L-system
• Title not available (Why is that?)
• Decidability of periodicity for infinite words
• On D0L power series
• Relations on words
• Decidability of uniform recurrence of morphic sequences
• Periodicity and ultimate periodicity of D0L systems
• A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
• The finiteness problem for monoids of morphisms.
• On the subword equivalence problem for morphic words
• On D0L and HDT0L sets in monoids
• Bounded D0L languages
• If a DOL language is k-power free then it is circular
• On the factors of automatic words
• Decidable problems in substitution shifts
• 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)