Cyclic renewal systems
We present three equivalent conditions for a generating set IN 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. (C) 2009 Elsevier B.V. All rights reserved.
cyclic renewal system generating set maximal monoid pure prefix code