BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY

DOI10.1142/S0129054111008301zbMath1215.68194OpenAlexW2043679478MaRDI QIDQ2997928

Štěpán Holub

Publication date: 10 May 2011

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

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

zbMATH Keywords

combinatorics on wordssuccessor morphismssuffix complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time

Cites Work

• The (generalized) Post correspondence problem with lists consisting of two words is decidable
• Binary (generalized) Post Correspondence Problem
• Binary equality sets are generated by two words

This page was built for publication: BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY