Linear time language recognition on cellular automata with restricted communication
From MaRDI portal
Recommendations
Cited in
(17)- Hierarchies and undecidability results for iterative arrays with sparse communication
- On two-way communication in cellular automata with a fixed number of cells
- Cellular automata with sparse communication
- Iterative arrays with finite inter-cell communication
- On one-way one-bit O (one)-message cellular automata
- Cellular Automata with Sparse Communication
- Language classes defined by time-bounded relativised cellular automata
- scientific article; zbMATH DE number 1834667 (Why is no real title available?)
- scientific article; zbMATH DE number 769370 (Why is no real title available?)
- Sublinear-time language recognition and decision by one-dimensional cellular automata
- TIGHT BOUNDS FOR THE SPACE COMPLEXITY OF NONREGULAR LANGUAGE RECOGNITION BY REAL-TIME MACHINES
- Cellular automata with limited inter-cell bandwidth
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
- Iterative arrays with finite inter-cell communication
- Cellular automata: communication matters
This page was built for publication: Linear time language recognition on cellular automata with restricted communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508397)
