Two-dimensional cellular automata recognizer
From MaRDI portal
(Redirected from Publication:1292301)
Recommendations
- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
- scientific article; zbMATH DE number 1254096
- Towards a basis for parallel language recognition by cellular automata
- Fast parallel language recognition by cellular automata
- scientific article; zbMATH DE number 769370
Cites work
- A linear speed-up theorem for cellular automata
- Language not recognizable in real time by one-way cellular automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
- Reversibility of 2D cellular automata is undecidable
- Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
- Simulations between cellular automata on Cayley graphs
- Some properties of two-dimensional on-line tessellation acceptors
- Two-dimensional iterative arrays: Characterizations and applications
Cited in
(16)- Towards a basis for parallel language recognition by cellular automata
- Closure properties of cellular automata
- Two-dimensional cellular automata
- scientific article; zbMATH DE number 4045203 (Why is no real title available?)
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Comparing 1D and 2D real time on cellular automata
- Asynchronous communicating cellular automata: formalization, robustness and equivalence
- Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton
- Two-dimensional cellular automata and their neighborhoods
- Constant acceleration theorem for extended von Neumann neighbourhoods
- Two-dimensional cellular automata and deterministic on-line tessalation automata
- scientific article; zbMATH DE number 4001511 (Why is no real title available?)
- Parallel recognition of rational languages in plane cellular automata
- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- Inductive definitions in logic versus programs of real-time cellular automata
This page was built for publication: Two-dimensional cellular automata recognizer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292301)
