Large simple binary equality words

DOI10.1142/S0129054112500207MaRDI QIDQ4923286zbMATH OpenOpenAlexFDO

Authors Jana Hadravová, Štěpán Holub

Publication date 6 June 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054112500207

zbMATH Keywords

combinatorics on wordsPost correspondence problemequality set

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Large Simple Binary Equality Words
• Binary equality words with two \(b\)'s.
• scientific article; zbMATH DE number 1948502
• The equations h(w)=w^ n in binary alphabets
• Binary equality sets are generated by two words

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• A variant of a recursively unsolvable problem
• Decision problems for semi-Thue systems with a few rules
• Reduction tree of the binary generalized post correspondence problem
• The (generalized) Post correspondence problem with lists consisting of two words is decidable

Cited in

(6)

• Binary codes that do not preserve primitivity
• Binary equality words with two \(b\)'s.
• A length bound for binary equality words
• The block structure of successor morphisms
• Large Simple Binary Equality Words
• Periodicity forcing words

This page was built for publication: Large simple binary equality words

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