| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438038 | Theoretical Computer Science | 2009 | 10 Pages |
Abstract
We present three equivalent conditions for a generating set W of a renewal system to generate a maximal monoid in the language of the system. We show that if a code W generates a shift of finite type and satisfies those conditions, then it is cyclic. Sufficient conditions are given when the converse holds.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
