ON THE TRANSITION SEMIGROUPS OF CENTRALLY LABELED RAUZY GRAPHS
2012 ◽
Vol 22
(02)
◽
pp. 1250018
◽
Keyword(s):
Rauzy graphs of subshifts are endowed with an automaton structure. For Sturmian subshifts, it is shown that its transition semigroup is the syntactic semigroup of the language recognized by the automaton. An inverse limit of the partial semigroups of nonzero regular elements of their transition semigroups is described. If the subshift is minimal, then this inverse limit is isomorphic, as a partial semigroup, to the [Formula: see text]-class associated to it in the free pro-aperiodic semigroup.
2015 ◽
Vol 26
(07)
◽
pp. 913-931
◽
Keyword(s):
2018 ◽
Vol 21
(7-8)
◽
pp. 1479-1494
◽
1996 ◽
Vol 11
(18)
◽
pp. 3257-3295
◽
Keyword(s):
1979 ◽
Vol 20
(2)
◽
pp. 125-128
◽
Keyword(s):