Some results on time-varying and relativised cellular automata*
From MaRDI portal
Publication:4016899
Recommendations
- Language classes defined by time-bounded relativised cellular automata
- Constructible functions in cellular automata and their applications to hierarchy results
- scientific article; zbMATH DE number 3872685
- Fast parallel language recognition by cellular automata
- A characterization of constant-time cellular automata computation
Cites work
- Cellular automata complexity trade-offs
- scientific article; zbMATH DE number 3883629 (Why is no real title available?)
- scientific article; zbMATH DE number 1300963 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Indecomposable local maps of tessellation automata
- On real-time cellular automata and trellis automata
- On Some Open Problems in the Theory of Cellular Automata
- One-way bounded cellular automata
- Real-time language recognition by one-dimensional cellular automata
- Relating the power of cellular arrays to their closure properties
- Terminal weighted grammars and picture description
- Time varying finite automata
- Time varying pushdown automata
Cited in
(4)
This page was built for publication: Some results on time-varying and relativised cellular automata*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016899)
