Fast parallel language recognition by cellular automata
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 41, 231-246
- https://doi.org/10.1016/0304-3975(85)90073-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Designing Systolic Algorithms Using Sequential MachinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Sequential Machine Characterizations of Trellis and Cellular Automata and ApplicationsSIAM Journal on Computing, 1985
- Characterizations and computational complexity of systolic trellis automataTheoretical Computer Science, 1984
- Parallel language recognition in constant time by cellular automataActa Informatica, 1983
- One-way bounded cellular automataInformation and Control, 1980
- Real-time language recognition by one-dimensional cellular automataJournal of Computer and System Sciences, 1972
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968