English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23195997      Online Users : 263
RC Version 7.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
    NCU Institutional Repository > 理學院 > 數學系 > 期刊論文 >  Item 987654321/51215


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/51215


    Title: The Complexity of Permutive Cellular Automata
    Authors: Ban,JC;Chang,CH;Chen,TJ;Lin,MS
    Contributors: 數學系
    Keywords: REACTION-DIFFUSION EQUATIONS;EXCITABLE MEDIA;CHAOS
    Date: 2011
    Issue Date: 2012-03-27 18:25:10 (UTC+8)
    Publisher: 國立中央大學
    Abstract: This paper studies one-dimensional permutive cellular automata in two aspects: Ergodic and topological behavior. Through investigating measure-theoretic entropy and topological pressure, we show taht Parry measure is the unique equilibrium measure whenever the potential function depends on one coordinate. In other words, permutive cellular automata exhibit no phase transition. Furthermore, the existence of snap-back repellers for a cellular automaton infers Li-Yorke chaos and bipermutive cellular automata guarantee the subsistence of snap-back repellers.
    Relation: JOURNAL OF CELLULAR AUTOMATA
    Appears in Collections:[數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML513View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明