Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Finite automata and their decision problems
IBM Journal of Research and Development
Designing systolic algorithms using sequential machines
IEEE Transactions on Computers - The MIT Press scientific computation series
Parallel parsing on a one-way array of finite-state machines
IEEE Transactions on Computers
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
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
Machine Complexity Versus Interconnection Complexity in Iterative Arrays
IEEE Transactions on Computers
On Some Open Problems in the Theory of Cellular Automata
IEEE Transactions on Computers
Mesh-Connected Computers with Broadcasting
IEEE Transactions on Computers
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Searching for Gapped Palindromes
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Languages not recognizable in real time by one-dimensional cellular automata
Journal of Computer and System Sciences
Searching for gapped palindromes
Theoretical Computer Science
Real-time reversible iterative arrays
Theoretical Computer Science
Mirroring: a technique for pipelining semi-systolic and systolic arrays
Integration, the VLSI Journal
A real-time systolic integer multiplier
Integration, the VLSI Journal
1-Way stack automaton with jumps
Journal of Computer and System Sciences
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
Achieving universal computations on one-dimensional cellular automata
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Cellular automata with limited inter-cell bandwidth
Theoretical Computer Science
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Fast iterative arrays with restricted inter-cell communication: constructions and decidability
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of 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
Grids and universal computations on one-dimensional cellular automata
Natural Computing: an international journal
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata
Fundamenta Informaticae - Cellular Automata
On Interacting Automata with Limited Nondeterminism
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 | 15.00 |
An n-dimensional iterative array of finite-state machines is formally introduced as a real-time tape acceptor. The computational characteristics of iterative arrays are illuminated by establishing several results concerning the sets of tapes that they recognize. Intercommunication between machines in an array is characterized by specifying a stencil for the array. The computing capability of the array is preserved even if its stencil is reduced to a simple form in which machines communicate only with their nearest neighbors. An increase of computing speed by a constant factor k is defined by encoding k-length blocks of the input tapes, which reduces the lengths of the tapes by 1/k; the time available for computation is correspondingly reduced since the computation must be real time. The computation speed of iterative arrays can be increased by any constant factor k. Two examples of one-dimensional arrays are provided. The first accepts the set of palindromes; the second accepts the set of all tapes of the form tt (for any tape t). The latter set of tapes is not a context-free language; therefore, the sets of tapes accepted by iterative arrays are not all contained in the class of context-free languages. Conversely, the class of context-free languages is not contained in the class of sets of tapes accepted by iterative arrays. The sets of tapes accepted by iterative arrays are closed under the operations: union, intersection, and complement; therefore, they form a Boolean algebra. They are not closed under the reflection or concatenation-product operations.