Iterative arrays with a wee bit alternation
An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. We are investigating iterative arrays with an alternating communication cell. All the other automata are deterministic. The number of alternating state transitions is regarded as a limited resource which depends on the length of the input.
We center our attention to real-time computations and compare alternating IAs with nondeterministic IAs. By proving that the language families of the latter are not closed under complement for sublogarithmic limits it is shown that alternation is strictly more powerful than nondeterminism. Moreover, for these limits there exist infinite hierarchies of properly included alternating language families. It is shown that these families are closed under boolean operations.
KeywordsTuring Machine Existential State Communication Cell Computation Tree Closure Property
Unable to display preview. Download preview PDF.
- Beyer, W. T. Recognition of topological invariants by iterative arrays. Technical Report TR-66, MIT, Cambridge, Proj. MAC, 1969.Google Scholar
- Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with a wee bit alternation. IFIG Report 9905, Institute of Informatics, University of Giessen, 1999.Google Scholar
- Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with limited nondeterministic communication cell. IFIG Report 9901, Institute of Informatics, University of Giessen, 1999.Google Scholar