Cellular automata: communication matters
From MaRDI portal
Cites work
- A note on semilinear sets and bounded-reversal multihead pushdown automata
- Cellular automata with sparse communication
- Cellular devices and unary languages
- Computations and decidability of iterative arrays with restricted communication
- Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
- Finite automata and unary languages
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3718546 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (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?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- Iterative arrays with finite inter-cell communication
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- On one-way one-bit O (one)-message cellular automata
- On time computability of functions in one-way cellular automata
- One-way cellular automata, bounded languages, and minimal communication
- Optimal simulations between unary automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Signals in one-dimensional cellular automata
- Simple matrix languages
- Some remarks about the efficiency of polyautomata
- Tally languages and complexity classes
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
This page was built for publication: Cellular automata: communication matters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030917)
