Large Simple Binary Equality Words

DOI10.1007/978-3-540-85780-8_31zbMath1159.68030OpenAlexW1620760778MaRDI QIDQ3533027

Jana Hadravová, Štěpán Holub

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_31

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

ON THE DUAL POST CORRESPONDENCE PROBLEM

Cites Work

• On binary equality sets and a solution to the test set conjecture in the binary case
• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Binary equality sets are generated by two words
• REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM
• A Purely Homomorphic Characterization of Recursively Enumerable Sets
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large Simple Binary Equality Words