Fast parallel language recognition by cellular automata
type: Item
instance of: scholarly article
title: Fast parallel language recognition by cellular automata
zbMATH Open document ID: 0591.68054
DOI: 10.1016/0304-3975(85)90073-8
author: Oscar H. Ibarra
author: Michael A. Palis
author: Sam M. Kim
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 3949719
zbMATH Keywords: linear cellular automata
zbMATH Keywords: context-free languages
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90073-8
OpenAlex ID: W2090079828
cites work: Q5615059
cites work: One-way bounded cellular automata
cites work: Computational Complexity of One-Tape Turing Machine Computations
cites work: Characterizations and computational complexity of systolic trellis automata
cites work: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
cites work: Q3926078
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: Parallel language recognition in constant time by cellular automata
Recommended article: Q3636524
Recommended article: Fast reversible language recognition using cellular automata
Recommended article: Q5010300
Recommended article: Language Recognition by Reversible Partitioned Cellular Automata
Recommended article: Q4227124
Recommended article: Q4294242
Recommended article: Q4536427
Recommended article: Parallel recognition of rational languages in plane cellular automata
Recommended article: Q4941904
Recommended article: Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata
description: scientific article; zbMATH DE number 3949719