Periodicity forcing words

DOI10.1016/J.TCS.2015.08.033zbMATH Open1329.68195OpenAlexW2294790463MaRDI QIDQ496053FDOQ496053

Authors: Joel D. Day, Daniel Reidenbach, Johannes 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

Recommendations

• Periodicity forcing words
• On the dual Post correspondence problem
• On the dual Post correspondence problem
• scientific article; zbMATH DE number 1860694
• On F-prime solutions of the Post correspondence problem

zbMATH Keywords

morphismsambiguity of morphismsdual Post correspondence problemequality setsperiodicity forcing setsperiodicity forcing words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• A variant of a recursively unsolvable problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Morphically primitive words
• Binary equality sets are generated by two words
• Intricacies of simple word equations: an example
• Periodicity forcing words
• Reduction tree of the binary generalized post correspondence problem
• Linear size test sets for certain commutative languages
• Title not available (Why is that?)
• Large simple binary equality words
• On the dual Post correspondence problem

Cited In (5)

• On the dual Post correspondence problem
• Binary equality words with two \(b\)'s.
• On the dual Post correspondence problem
• Title not available (Why is that?)
• Periodicity forcing words

This page was built for publication: Periodicity forcing words

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