Abstract. Iterative arrays with restricted nondeterminism are investigated. Non- determinism is provided for the distinguished communication cell only.
An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside ...
It is shown that the limit can be reduced by a constant factor without aaecting the language accepting capabilities, but for sublogarithmic limits there ...
Iterative arrays with restricted nondeterminism are investigated. Non-determinism is provided for the distinguished communication cell only.
It is shown that the limit can be reduced by a constant factor without affecting the language accepting capabilities, but for sublogarithmic limits there ...
Bibliographic information ; Authors, Thomas Buchholz, Andreas Klein, Martin Kutrib ; Publisher, IFIG, 1999 ; Length, 27 pages ; Export Citation, BiBTeX EndNote ...
Nov 5, 2020 · We study the computational capacity of self-verifying iterative arrays ( SVIA ). A self-verifying device is a nondeterministic device whose ...
Iterative arrays with finite inter-cell communication | Natural Computing
link.springer.com › article
Oct 24, 2020 · Iterative arrays are studied where the maximum number of communications per cell occurring in accepting computations is drastically bounded by a constant ...
We study the computational capacity of self-verifying iterative arrays ( $${\text {SVIA}}$$ ). A self-verifying device is a nondeterministic device whose ...
Oct 11, 2019 · Abstract. Iterative arrays whose internal inter-cell communication is quantitatively restricted are investigated. The quantity of communica-.