Loading...
Please wait, while we are loading the content...
On interacting automata with limited nondeterminism (2002).
| Content Provider | CiteSeerX |
|---|---|
| Author | Buchholz, Thomas Klein, Andreas Kutrib, Martin |
| Abstract | 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. |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Interacting Automaton Limited Nondeterminism Io Press Constant Number Deterministic Language Family Important Subclass Speed-up Result Strong Closure Property Deterministic Array Restricted Nondeterminism Two-way Cellular Language Acceptor Nondeterministic State Transition Unrestricted-time Computation Nondeterministic Transition Limited Resource Free Homomorphism Linear-time Computation |
| Content Type | Text |