Cyclic renewal systems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hong, S | ko |
| dc.contributor.author | Shin, Sujin | ko |
| dc.date.accessioned | 2013-03-11T00:03:16Z | - |
| dc.date.available | 2013-03-11T00:03:16Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2009-06 | - |
| dc.identifier.citation | THEORETICAL COMPUTER SCIENCE, v.410, no.27-29, pp.2675 - 2684 | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/97743 | - |
| dc.description.abstract | 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. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | Cyclic renewal systems | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000267160800012 | - |
| dc.identifier.scopusid | 2-s2.0-67349167128 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 410 | - |
| dc.citation.issue | 27-29 | - |
| dc.citation.beginningpage | 2675 | - |
| dc.citation.endingpage | 2684 | - |
| dc.citation.publicationname | THEORETICAL COMPUTER SCIENCE | - |
| dc.identifier.doi | 10.1016/j.tcs.2009.03.033 | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | Shin, Sujin | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | Renewal system | - |
| dc.subject.keywordAuthor | Generating set | - |
| dc.subject.keywordAuthor | Cyclic | - |
| dc.subject.keywordAuthor | Pure | - |
| dc.subject.keywordAuthor | Prefix code | - |
| dc.subject.keywordAuthor | Maximal monoid | - |
- 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 |  |
| ⊙ Cited 3 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.