Binary morphisms with stable suffix complexity

DOI10.1142/S0129054111008301MaRDI QIDQ2997928zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

combinatorics on wordssuccessor morphismssuffix complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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

Cites work

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

Cited in

(3)

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

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)