Existence of an infinite word whose sequence of Rauzy graphs contains a subsequence of graphs that are homeomorphic to given digraphs

zbMATH Open1249.65280MaRDI QIDQ3115707FDOQ3115707

Authors:

Publication date: 10 February 2012

Recommendations

• On uniformly recurrent words generated by shifting segments, including with a change in orientation
• Publication:4936661
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Rigidity and substitutive dendric words
• Episturmian words and some constructions of de Luca and Rauzy

zbMATH Keywords

infinite wordRauzy graphuniform recurrency

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Numerical methods for integral transforms (65R10) Combinatorics on words (68R15)

Cited In (3)

• Title not available (Why is that?)
• \(\ell\times\ell'\)-Rauzy graphs for infinite arrays
• On uniformly recurrent words generated by shifting segments, including with a change in orientation

This page was built for publication: Existence of an infinite word whose sequence of Rauzy graphs contains a subsequence of graphs that are homeomorphic to given digraphs

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