| 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 | 25-Jan-2021 14:24:35 (UTC+8) | - |
| dc.date.available | 25-Jan-2021 14:24:35 (UTC+8) | - |
| dc.date.issued (上傳時間) | 25-Jan-2021 14:24:35 (UTC+8) | - |
| dc.identifier.uri (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 | |
