Counting fixed points and pure 2-cycles of tree cellular automata

DOI10.1007/978-3-031-55601-2_16MaRDI QIDQ6547960

Volker Turau

Publication date: 31 May 2024

zbMATH Keywords

fixed pointscounting problemstree cellular automata

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic minority on graphs
• Maximum number of fixed points in regulatory Boolean networks
• The number of fixed points of the majority rule
• Periodic behaviour of generalized threshold functions
• The \(r\)-majority vote action on 0-1 sequences
• Local majorities, coalitions and monopolies in graphs: A review
• Enumerating periodic orbits in sequential dynamical systems over graphs
• Fixed points and 2-cycles of synchronous dynamic coloring processes on trees
• Complexity of fixed point counting problems in Boolean networks
• On periodical behaviour in societies with symmetric influences
• Maximum number of fixed points in AND-OR-NOT networks
• Predecessor existence problems for finite discrete dynamical systems
• Improving the efficiency of attractor cycle identification in Boolean networks
• Minimum monopoly in regular and tree graphs
• On the computation of fixed points in Boolean networks
• Unconventional Computation
• The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity

This page was built for publication: Counting fixed points and pure 2-cycles of tree cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547960)