LARGE SIMPLE BINARY EQUALITY WORDS

DOI10.1142/S0129054112500207zbMath1266.68149OpenAlexW1984024342MaRDI QIDQ4923286

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)

Related Items (2)

Periodicity forcing words ⋮ Binary codes that do not preserve primitivity

Cites Work

• Unnamed Item
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Decision problems for semi-Thue systems with a few rules
• REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• A variant of a recursively unsolvable problem

This page was built for publication: LARGE SIMPLE BINARY EQUALITY WORDS