Sciweavers

FUIN
2002

On Interacting Automata with Limited Nondeterminism

13 years 10 months ago
On Interacting Automata with Limited Nondeterminism
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 -free homomorphisms is given. Finally we prove strong closure properties of languages acceptable with a constant number of nondeterministic transitions.
Thomas Buchholz, Andreas Klein, Martin Kutrib
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2002
Where FUIN
Authors Thomas Buchholz, Andreas Klein, Martin Kutrib
Comments (0)