Existence of arbitrarily long square-free words with one possible mismatch

DOI10.1515/DMA-2015-0033MaRDI QIDQ314161zbMATHOpenAlexFDO

Authors Nikita V. Kotlyarov

Publication date 13 September 2016

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2015-0033

zbMATH Keywords

formal languagessquare-free wordsmismatchperiodic structures in wordsThue sequenceword combinatorics

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Square-free words with one possible mismatch
• Existence of words over a binary alphabet free from squares with mismatches
• Infinite words containing the minimal number of repetitions
• Square-free partial words
• Existence of words over three-letter alphabet not containing squares with replacement errors

Cited in

(2)

• Existence of words over a binary alphabet free from squares with mismatches
• Square-free words with one possible mismatch

This page was built for publication: Existence of arbitrarily long square-free words with one possible mismatch

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