Periodicity forcing words

DOI10.1016/J.TCS.2015.08.033zbMath1329.68195OpenAlexW2294790463MaRDI QIDQ496053

Daniel Reidenbach, Joel D. Day, Johannes C. Schneider

Publication date: 16 September 2015

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.033

zbMATH Keywords

morphismsambiguity of morphismsdual Post correspondence problemequality setsperiodicity forcing setsperiodicity forcing words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Binary equality words with two $b$'s

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Morphically primitive words
• Binary equality sets are generated by two words
• Periodicity Forcing Words
• REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM
• Linear size test sets for certain commutative languages
• INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
• LARGE SIMPLE BINARY EQUALITY WORDS
• On the Dual Post Correspondence Problem
• A variant of a recursively unsolvable problem

This page was built for publication: Periodicity forcing words