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.
KeywordsCellular Automaton Finite Automaton Closure Property Global Transition Language Recognition
Unable to display preview. Download preview PDF.
- Buchholz, Th., Klein, A., Kutrib, M.: One guess one-way cellular arrays. Research Report 9801, Institute of Informatics, University of Giessen, Gießen, 1998.Google Scholar
- Kutrib, M.: Pushdown cellular automata. Theoret. Comput. Sci. (1998)Google Scholar
- Kutrib, M., Richstein, J.: Real-time one-way pushdown cellular automata languages. In: Developments in Language Theory II. At the Crossroads of Mathematics, Computer Science and Biology, World Scientific, Singapore, (1996) 420–429Google Scholar
- Seidel, S. R.: Language recognition and the synchronization of cellular automata. Technical Report 79-02, Department of Computer Science, University of Iowa, 1979Google Scholar