The equations \(h(w)=w^ n\) in binary alphabets

DOI10.1016/0304-3975(84)90093-8zbMath0548.20044OpenAlexW1980116034MaRDI QIDQ799819

Matti Linna, Tero J.Harju

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90093-8

zbMATH Keywords

solutionsendomorphismbinary alphabetsfinitely generated word semigroupprimitive solution

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Mappings of semigroups (20M15)

Related Items (3)

On the periodicity of morphisms on free monoids ⋮ On the conjugation of standard morphisms ⋮ Repetitiveness of languages generated by morphisms

Cites Work

• Unnamed Item

This page was built for publication: The equations \(h(w)=w^ n\) in binary alphabets