Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/133714
DC Field | Value | Language |
---|---|---|
dc.contributor | 應數系 | |
dc.creator | 班榮超 | |
dc.creator | Ban, Jung-Chao | |
dc.creator | Chang, Chih-Hung | |
dc.creator | Huang, Yu-Hsiung | |
dc.date | 2020-04 | |
dc.date.accessioned | 2021-01-25T06:24:35Z | - |
dc.date.available | 2021-01-25T06:24:35Z | - |
dc.date.issued | 2021-01-25T06:24:35Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/133714 | - |
dc.description.abstract | Let G=⟨S|RA⟩G=⟨S|RA⟩ be a semigroup with generating set S and equivalences RARA among S determined by a matrix A. This paper investigates the complexity of G-shift spaces by yielding the Petersen–Salama entropies [defined in Petersen and Salama (Theoret Comput Sci 743:64–71, 2018)]. After revealing the existence of Petersen–Salama entropy of G-shift of finite type (G-SFT), the calculation of Petersen–Salama entropy of G-SFT is equivalent to solving a system of nonlinear recurrence equations. The complete characterization of Petersen–Salama entropies of G-SFTs on two symbols is addressed, which extends (Ban and Chang in On the topological entropy of subshifts of finite type on free semigroups, 2018. arXiv:1702.04394) in which G is a free semigroup. | |
dc.format.extent | 393209 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | Journal of Algebraic Combinatorics | |
dc.title | Complexity of Shift Spaces on Semigroups | |
dc.type | article | |
item.grantfulltext | restricted | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | 期刊論文 |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.