论文信息 - On Cellular Automata with a Finite Number of State Changes

On Cellular Automata with a Finite Number of State Changes

On Cellular Automata with a Finite Number of State Changes. The number of state changes is introduced as a complexity measure for the recognition of languages in cellular automata. The relation of the simplest class — i.e. the one with a constant number of changes per single automaton — to the Chomsky hierarchy is investigated and a comparison with sequential tape complexity is made.

R. Vollmar

[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[2] Hidenosuke Nishio,et al. HEURISTIC USE OF IMAGE PROCESSING TECHNIQUE FOR THEORETICAL STUDIES OF AUTOMATA , 1972 .

[3] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[4] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[5] Roland Vollmar. Algorithmen in Zellularautomaten , 1979 .

[6] Sheila A. Greibach. Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines , 1978, Inf. Control..

[7] Michael Thompson,et al. Frontiers of Pattern Recognition , 1975 .