A characterization of free pairs of upper triangular free monoid morphisms

DOI10.1016/j.ic.2019.03.007zbMath1477.68172OpenAlexW2931642470WikidataQ128143342 ScholiaQ128143342MaRDI QIDQ2417854

Juha Honkala

Publication date: 29 May 2019

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2019.03.007

zbMATH Keywords

decidabilitycodefreeness problemcombinatorics on morphismsfree monoid morphism

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Remarks concerning the freeness problem over morphism and matrix semigroups.
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• On the decidability of semigroup freeness
• Invertible Substitutions with a Common Periodic Point
• Simplifications of homomorphisms
• Automatic Sequences
• ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS

This page was built for publication: A characterization of free pairs of upper triangular free monoid morphisms