Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Formal languages and their relation to automata
Formal languages and their relation to automata
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Cellular automata and formal languages
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
Two-dimensional formal languages and pattern recognition by cellular automata
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Designing systolic algorithms using sequential machines
IEEE Transactions on Computers - The MIT Press scientific computation series
Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Iterative Arrays with Small Time Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Real-Time Language Recognition by Alternating Cellular Automata
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On Time-Constructible Functions in One-Dimensional Cellular Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Iterative Arrays with a Wee Bit Alternation
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Speeding-Up Cellular Automata by Alternations
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Finite turns and the regular closure of linear context-free languages
Discrete Applied Mathematics
Real-time reversible iterative arrays
Theoretical Computer Science
On “forgetful” cellular automata
Journal of Computer and System Sciences
Surjectivity of nondeterministic parallel maps induced bynondeterministic cellular automata
Journal of Computer and System Sciences
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
Incremental learning of cellular automata for parallel recognition of formal languages
DS'10 Proceedings of the 13th international conference on Discovery science
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Sequence generation problem on communication-restricted cellular automata
NOLASC'06 Proceedings of the 5th WSEAS international conference on Non-linear analysis, non-linear systems and chaos
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science
Cellular automata: real-time equivalence between one-dimensional neighborhoods
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
A study on learning robustness using asynchronous 1D cellular automata rules
Natural Computing: an international journal
Different Types of Linear Fuzzy Cellular Automata and their Applications
Fundamenta Informaticae - Membrane Computing
A Neuro-Genetic Framework for Pattern Recognition in Complex Systems
Fundamenta Informaticae - Membrane Computing
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Space- and Time-Bounded Nondeterminism for Cellular Automata
Fundamenta Informaticae - Cellular Automata
Information Dynamics of Cellular Automata I - An Algebraic Study
Fundamenta Informaticae - Cellular Automata
Real-Time Generation of Primes by a 1-Bit-Communication Cellular Automaton
Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism
Fundamenta Informaticae - Cellular Automata
Fundamenta Informaticae - Cellular Automata
Real-time reversible iterative arrays
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A padding technique on cellular automata to transfer inclusions of complexity classes
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Real time language recognition on 2D cellular automata: dealing with non-convex neighborhoods
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Pattern recognition by parallel devices is investigated by studying the formal language recognition capabilities of one-dimensional cellular automata. The precise relationships of cellular automata to iterative automata and to Turing machines are established: In both cases, cellular automata are inherently faster. The relationship of context-free languages to the languages recognized in real time by bounded cellular automata is detailed. In particular, nondeterministic bounded cellular automata can recognize the context-free languages in real time. The deterministic case remains open, but many partial results are derived. Finally, closure properties and cellular automata transformation lemmas are presented.