Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:3802629

zbMath0655.68065MaRDI QIDQ3802629

Karel II Culik, Juergen Albert

Publication date: 1987


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (26)

Grids and universal computations on one-dimensional cellular automataCellular automata universality revisitedComplexity of reachability problems for finite discrete dynamical systemsOn totalistic systolic networksEfficient unidimensional universal cellular automatonDecision problems for cellular automata and their semigroupsOn Goles' universal machines: a computational point of viewFour states are enough!Communication complexity meets cellular automata: necessary conditions for intrinsic universalityA survey of cellular automata: types, dynamics, non-uniformity and applicationsSimulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata LeverageLogical Gates via Gliders CollisionsSynthesis, structure and power of systolic computationsPredecessor existence problems for finite discrete dynamical systemsCellular automata, \(\omega{} \omega\)-regular sets, and sofic systemsIntrinsically universal \(n\)-dimensional quantum cellular automataPartitioned quantum cellular automata are intrinsically universalBulking I: An abstract theory of bulkingNumber-Conserving Reversible Cellular Automata and Their Computation-UniversalityTheory of cellular automata: a surveyOn hardest languages for one-dimensional cellular automataInducing an order on cellular automata by a grouping operationA universal cellular automaton in quasi-linear time and its S-m-n formComputation theoretic aspects of cellular automataClassifying circular cellular automataUniversality and decidability of number-conserving cellular automata







This page was built for publication: