Binary morphisms with stable suffix complexity

DOI10.1142/S0129054111008301zbMATH Open1215.68194OpenAlexW2043679478MaRDI QIDQ2997928FDOQ2997928

Authors: Š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

Recommendations

• The block structure of successor morphisms
• scientific article; zbMATH DE number 3856427
• The structure of infinite solutions of marked and binary Post correspondence problems
• Generalized Post correspondence problem for marked morphisms
• scientific article; zbMATH DE number 1522564

zbMATH Keywords

combinatorics on wordssuccessor morphismssuffix complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

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

Cited In (3)

• Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time
• The block structure of successor morphisms
• Universal terms of complexity three

This page was built for publication: Binary morphisms with stable suffix complexity

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