A note on the Markov condition and central words

DOI10.1016/J.IPL.2007.09.005MaRDI QIDQ2380082zbMATH OpenOpenAlexFDO

Authors Amy Glen, Aaron Lauve, Franco Saliola

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0708.4217

zbMATH Keywords

balanced wordscentral wordsChristoffel wordscombinatorial problemsMarkov conditionpalindromes

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: We define Markoff words as certain factors appearing in bi-infinite words satisfying the Markoff condition. We prove that these words coincide with central words, yielding a new characterization of Christoffel words.

Recommendations

• Combinatorics on words and the theory of Markoff
• Christoffel words and weak Markoff theory
• Christoffel Words and Markoff Triples
• From Christoffel Words to Markoff Numbers
• Developments in Language Theory

Cites work

• A combinatorial property of the Fibonacci words
• scientific article; zbMATH DE number 43747 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 1844170 (Why is no real title available?)
• On Markoff's property and Sturmian words
• Some combinatorial properties of Sturmian words
• Sturmian words: structure, combinatorics, and their arithmetics

Cited in

(4)

• Christoffel words and weak Markoff theory
• A characterization of Sturmian sequences by indistinguishable asymptotic pairs
• Markov word patterns and a relation on -words
• The q-analog of the Markoff injectivity conjecture over the language of a balanced sequence

This page was built for publication: A note on the Markov condition and central words

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