Language classes defined by time-bounded relativised cellular automata
From MaRDI portal
Recommendations
Cites work
- Cellular automata complexity trade-offs
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- scientific article; zbMATH DE number 46423 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 1300963 (Why is no real title available?)
- On One-Way Cellular Arrays
- On real-time cellular automata and trellis 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
- Some results on time-varying and relativised cellular automata*
- Systolic trellis automatata †
- Tally languages and complexity classes
Cited in
(4)
This page was built for publication: Language classes defined by time-bounded relativised cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288203)