Name
Abstract | ||
|---|---|---|
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 J -class associated to it in the free pro-aperiodic semigroup. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1142/S021819671250018X | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
Rauzy graph, minimal subshift, irreducible subshift, automaton, transition semigroup, free profinite semigroup, syntactic semigroup, aperiodic semigroup | Discrete mathematics,Bicyclic semigroup,Combinatorics,Cancellative semigroup,Algebra,Automaton,Inverse limit,Isomorphism,Aperiodic semigroup,Special classes of semigroups,Semigroup,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 2 | 0218-1967 |
Citations | PageRank | References |
1 | 0.39 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Almeida | 1 | 61 | 15.24 |
| Alfredo Costa | 2 | 5 | 2.25 |