On real-time cellular automata and trellis automata
Acta Informatica
SIAM Journal on Computing
On the power of one-way communication
Journal of the ACM (JACM)
Relating the power of cellular arrays to their closure properties
Theoretical Computer Science
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences
On real time one-way cellular array
Theoretical Computer Science
On the Amount of Nondeterminism and the Power of Verifying
SIAM Journal on Computing
Theoretical Computer Science
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Two-way balloon automata and AFL
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
One Guess One-Way Cellular Arrays
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
IEEE Transactions on Computers
Real-time language recognition by one-dimensional cellular automata
Journal of Computer and System Sciences
Different Types of Linear Fuzzy Cellular Automata and their Applications
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
Hi-index | 0.00 |
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource which depends on the length of the input. We center our attention to real-time, linear-time and unrestricted-time computations. A speed-up result that allows any linear-time computation to be sped-up to real-time is proved. The relationships to deterministic arrays are considered. For an important subclass a characterization in terms of deterministic language families and $\epsilon$-free homomorphisms is given. Finally we prove strong closure properties of languages acceptable with a constant number of nondeterministic transitions.