English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 94586/125118 (76%)
Visitors : 30546291      Online Users : 357
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/129754
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/129754

    Title: Decidability of Irreducible tree shifts of finite type
    Authors: 班榮超
    Ban, Jung-Chao
    Chang, Chih-Hung;Huang, Nai-Zhu;Wu, Yu-Liang
    Contributors: 應數系
    Keywords: Tree shift of finite type;Irreducible;  Complex prefix code;  Graph representation;  Strongly periodic point
    Date: 2019-10
    Issue Date: 2020-05-25 12:24:27 (UTC+8)
    Abstract: We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT), we show that the CPC-irreducibility of TSFTs is related to the connectivity of its graph representation, which is a similar result to one-dimensional shifts of finite type.
    Relation: Journal of Statistical Physics, p.1-20
    Data Type: 期刊論文
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    13.pdf409KbAdobe PDF31View/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