6533b7d5fe1ef96bd1265245
RESEARCH PRODUCT
A note on renewal systems
Antonio Restivosubject
Discrete mathematicsAlgebraGeneral Computer ScienceFormal languageMarkov systemsDynamical system (definition)Topological conjugacyFinite setComputer Science::Formal Languages and Automata TheoryDecidabilityMathematicsTheoretical Computer ScienceComputer Science(all)description
Abstract A renewal system is a symbolic dynamical system generated by free concatenations of a finite set of words. In this paper we prove that, given two systems which are both renewal and Markov systems, it is decidable whether they are topologically conjugate. The proof makes use of the methods and the techniques of formal language theory.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1992-03-01 | Theoretical Computer Science |