Maxmin-ω : A Simple Deterministic Asynchronous Cellular Automaton Scheme

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on Cellular Automata for Research and Industry

• Publication date

  2016-09-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-44365-2_19
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Max-Plus Model of Asynchronous Cellular Automata

  2014cited by this paper
• Probing robustness of cellular automata through variations of asynchronous updating

  2012cited by this paper
• Maxmin-plus models of asynchronous computation

  2012cited by this paper
• Topology regulates pattern formation capacity of binary cellular automata on graphs

  2005cited by this paper
• Max Plus at Work: Modeling and Analysis of Synchronized Systems: A Course on Max-Plus Algebra and Its Applications

  2005cited by this paper
• An Experimental Study of Robustness to Asynchronism for Elementary Cellular Automata

  2004cited by this paper
• Synchronous and asynchronous updating in cellular automata.

  1999cited by this paper
• THE DUALITY THEOREM FOR MIN-MAX FUNCTIONS

  1997cited by this paper
• Synchronization and Linearity: An Algebra for Discrete Event Systems

  1994cited by this paper
• Statistical mechanics of cellular automata

  1983cited by this paper

• A new threshold model based on tropical mathematics reveals network backbones

  2021cites this paper
• The impact of alphabet size on pattern complexity of maxmin-ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega$$\

  2020influential citation
• Complexity of Maxmin-$$\omega $$ Cellular Automata

  2018cites this paper