A characterization of constant-time cellular automata computation
- 1 September 1990
- journal article
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 45 (1-3) , 404-419
- https://doi.org/10.1016/0167-2789(90)90198-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A polynomial time algorithm for the local testability problem of deterministic finite automataPublished by Springer Nature ,1989
- Fast parallel language recognition by cellular automataTheoretical Computer Science, 1985
- Some results concerning linear iterative (systolic) arraysJournal of Parallel and Distributed Computing, 1985
- Parallel language recognition in constant time by cellular automataActa Informatica, 1983
- Characterizations of locally testable eventsDiscrete Mathematics, 1973
- Real-time language recognition by one-dimensional cellular automataJournal of Computer and System Sciences, 1972