Cyclic renewal systems

Cited 3 time in webofscience Cited 0 time in scopus
  • Hit : 265
  • Download : 14
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.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2009-06
Language
English
Article Type
Article
Citation

THEORETICAL COMPUTER SCIENCE, v.410, no.27-29, pp.2675 - 2684

ISSN
0304-3975
DOI
10.1016/j.tcs.2009.03.033
URI
http://hdl.handle.net/10203/97743
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 3 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0