Codes and maximal monoids
Some results are given on maximal monoids in the language of the soficsystem generated by a finite code of words. (C) 2010 Elsevier B.V. All rights reserved.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 2010-03
- Language
- English
- Article Type
- Article
- Keywords
RENEWAL SYSTEMS; SUBMONOIDS; CONSTRAINTS
- Citation
THEORETICAL COMPUTER SCIENCE, v.411, no.16-18, pp.1809 - 1817
- ISSN
- 0304-3975
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.