English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94967/125512 (76%)
Visitors : 30674362      Online Users : 492
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/133714
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/133714

    Title: Complexity of Shift Spaces on Semigroups
    Authors: 班榮超
    Ban, Jung-Chao
    Chang, Chih-Hung
    Huang, Yu-Hsiung
    Contributors: 應數系
    Date: 2020-04
    Issue Date: 2021-01-25 14:24:35 (UTC+8)
    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.
    Relation: Journal of Algebraic Combinatorics
    Data Type: article
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    121.pdf383KbAdobe PDF12View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback