Relating the power of cellular arrays to their closure properties
From MaRDI portal
(Redirected from Publication:1104098)
Recommendations
- Closure properties of cellular automata
- scientific article; zbMATH DE number 4028909
- On One-Way Cellular Arrays
- scientific article; zbMATH DE number 4026832
- On cellular-compactness and related properties
- Self-closeness numbers of finite cell complexes
- scientific article; zbMATH DE number 4106255
- scientific article; zbMATH DE number 177187
- Estimates of effective characteristics of random cell structures in terms of effective characteristics of periodic structures
- scientific article; zbMATH DE number 17391
Cites work
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- Cellular automata complexity trade-offs
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems
- On One-Way Cellular Arrays
- On Some Open Problems in the Theory of Cellular Automata
- On real-time cellular automata and trellis automata
- Real-time language recognition by one-dimensional cellular automata
- Relationships between nondeterministic and deterministic tape complexities
- Systolic trellis automatata †
- Tape bounds for time-bounded Turing machines
Cited in
(19)- Closure properties of cellular automata
- Signals in one-dimensional cellular automata
- Languages not recognizable in real time by one-dimensional cellular automata
- On some open problems concerning the complexity of cellular arrays
- On real time one-way cellular array
- Low complexity classes of multidimensional cellular automata
- scientific article; zbMATH DE number 4028909 (Why is no real title available?)
- Real time recognition with cellular automata : a meaningful example
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Constructible functions in cellular automata and their applications to hierarchy results
- On hardest languages for one-dimensional cellular automata
- Two-dimensional cellular automata and deterministic on-line tessalation automata
- Language not recognizable in real time by one-way cellular automata
- Theory of cellular automata: a survey
- Some results on time-varying and relativised cellular automata*
- Non-deterministic cellular automata and languages
- Pushdown cellular automata
- On hardest languages for one-dimensional cellular automata
- Language classes defined by time-bounded relativised cellular automata
This page was built for publication: Relating the power of cellular arrays to their closure properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104098)
