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

DOI10.1016/0304-3975(84)90093-8zbMATH Open0548.20044OpenAlexW1980116034MaRDI QIDQ799819FDOQ799819

Authors: Tero Harju, Matti Linna 

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

Recommendations

• In search of a word with special combinatorial properties
• The expressibility of languages and relations by word equations
• scientific article; zbMATH DE number 709736
• Sets of primitive words given by fixed points of mappings
• The expressibility of languages and relations by word equations

zbMATH Keywords

endomorphismsolutionsbinary alphabetsfinitely generated word semigroupprimitive solution

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (8)

• Sets of primitive words given by fixed points of mappings
• Large simple binary equality words
• In search of a word with special combinatorial properties
• Commuting upper triangular binary morphisms
• On the periodicity of morphisms on free monoids
• On the conjugation of standard morphisms
• ON THE BURNSIDE SEMIGROUPS xⁿ = x^n+m
• Repetitiveness of languages generated by morphisms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799819)