Cyclic renewal systems

Authors:
Soonjo Hong;Sujin Shin
Affiliations:
Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology, Daejeon, 305-701, Republic of Korea;Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology, Daejeon, 305-701, Republic of Korea
Venue:
Theoretical Computer Science
Year:
2009

Citing 7
Cited 1

Coded systems

Theoretical Computer Science
Finitely generated sofic systems

Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Codes and local constraints

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
A note on renewal systems

Theoretical Computer Science - Special issue on discrete mathematics and applications to computer science
An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Symbolic dynamics and finite automata

Handbook of formal languages, vol. 2
Theory of Codes

Theory of Codes

Codes and maximal monoids

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

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.