Cellular automata with sparse communication
From MaRDI portal
Recommendations
- Cellular Automata with Sparse Communication
- Communications in cellular automata
- Cellular automata and communication complexity
- scientific article; zbMATH DE number 6502824
- On two-way communication in cellular automata with a fixed number of cells
- Communication complexity and intrinsic universality in cellular automata
- Bounded languages meet cellular automata with sparse communication
- Cellular automata with limited inter-cell bandwidth
- Traced communication complexity of cellular automata
Cites work
- Cellular automata -- a computational point of view
- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
- Fast reversible language recognition using cellular automata
- scientific article; zbMATH DE number 3718546 (Why is no real title available?)
- scientific article; zbMATH DE number 2068878 (Why is no real title available?)
- scientific article; zbMATH DE number 1512708 (Why is no real title available?)
- scientific article; zbMATH DE number 1886333 (Why is no real title available?)
- scientific article; zbMATH DE number 2113950 (Why is no real title available?)
- Iterative tree automata
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- On real-time cellular automata and trellis automata
- On time computability of functions in one-way cellular automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Signals in one-dimensional cellular automata
- Some remarks about the efficiency of polyautomata
Cited in
(27)- Counter machines and distributed automata -- a story about exchanging space and time
- Hierarchies and undecidability results for iterative arrays with sparse communication
- On two-way communication in cellular automata with a fixed number of cells
- A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
- The mirage of universality in cellular automata
- On the impact of treewidth in the computational complexity of freezing dynamics
- Emptiness problems for distributed automata
- Iterative arrays with finite inter-cell communication
- On one-way one-bit O (one)-message cellular automata
- In memoriam Chandra Kintala
- Measuring communication in automata systems (invited paper)
- scientific article; zbMATH DE number 6502824 (Why is no real title available?)
- scientific article; zbMATH DE number 5190413 (Why is no real title available?)
- Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol
- Cellular Automata with Sparse Communication
- Bounded languages meet cellular automata with sparse communication
- Determination of one-way bandwidth of cellular automata using binary decision diagrams
- Traced communication complexity of cellular automata
- Cellular automata with limited inter-cell bandwidth
- Freezing, bounded-change and convergent cellular automata
- Cold dynamics in cellular automata: a tutorial
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Iterative arrays with finite inter-cell communication
- On the parameterized complexity of freezing dynamics
- State-freezing pushdown automata
- A class of the smallest 4-state FSSP partial solutions for rings -- a survey
- Cellular automata: communication matters
This page was built for publication: Cellular automata with sparse communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1959660)
