• DocumentCode
    3130556
  • Title

    Computing on a Simple Asynchronous Cellular Automaton

  • Author

    Jia Lee ; Peper, Ferdinand ; Imai, Koichi

  • Author_Institution
    Coll. of Comput. Sci. Brain, Chongqing Univ., Chongqing, China
  • fYear
    2013
  • fDate
    4-6 Dec. 2013
  • Firstpage
    505
  • Lastpage
    509
  • Abstract
    An asynchronous cellular automaton (ACA) is a cellular automaton which allows cells to undergo state transitions independently at random timings. This paper gives an efficient scheme to compute on a special ACA model that takes a substantially simple transition function. This ACA has much less complexity as compared to other models with respect to the number of transition rules.
  • Keywords
    cellular automata; ACA model; asynchronous cellular automaton; random timings; state transition; transition function; Automata; Bars; Complexity theory; Computational modeling; Educational institutions; Integrated circuit modeling; Multiplexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computing and Networking (CANDAR), 2013 First International Symposium on
  • Conference_Location
    Matsuyama
  • Print_ISBN
    978-1-4799-2795-1
  • Type

    conf

  • DOI
    10.1109/CANDAR.2013.90
  • Filename
    6726952
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3130556