Unconventional Computation

DOI10.1007/11560319zbMath1161.68608OpenAlexW4254053743MaRDI QIDQ5479212

Gul A. Agha, Predrag T. Tosic

Publication date: 7 July 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11560319

zbMATH Keywords

computational complexitycellular automata\#P-completenessgraph automataconfiguration space propertiessequential and synchronous dynamical systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ Dichotomy results for fixed point counting in Boolean dynamical systems ⋮ Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems ⋮ On periods and equilibria of computational sequential systems ⋮ Enumerating periodic orbits in sequential dynamical systems over graphs

This page was built for publication: Unconventional Computation