Name
Abstract | ||
|---|---|---|
A language is torsion (resp. bounded torsion, aperiodic, bounded aperiodic), if its syntactic monoid is torsion (resp. bounded torsion, aperiodic, bounded aperiodic). We generalize the regular language theorems of Klenne, Schutzenberger and Straubing to describe the classes of torsion, bounded torsion, aperiodic and bounded aperiodic languages. These descriptions involve taking limits of sequences of languages and automata for certain topologies defined by filtrations of the free monoid. A theorem for arbitrary languages over finite alphabets is also stated and proved. |
Year | Venue | Field |
|---|---|---|
1995 | RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS | Combinatorics,Algebraic number,Pure mathematics,Free monoid,Mathematics,Alphabet |
DocType | Volume | Issue |
Journal | 29 | 1 |
ISSN | Citations | PageRank |
0988-3754 | 3 | 0.67 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Rhodes | 1 | 89 | 20.04 |
| Pascal Weil | 2 | 143 | 15.51 |