One Guess One-Way Cellular Arrays

One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a limit to exactly one step does not decrease the language accepting capabilities. We prove a speed-up result that allows any linear-time computation to be sped-up to real-time. Some relationships to deterministic arrays are considered. Finally we prove several closure properties of the real-time languages.

• Type: Conference
• Year: 1998
• Where: MFCS
• Authors: Thomas Buchholz, Andreas Klein, Martin Kutrib
• Keywords: Language Accepting Capabilities, MFCS 1998, Nondeterministic State Transitions, One-way Cellular Automata, Theoretical Computer Science