Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
From MaRDI portal
Recommendations
Cited in
(35)- On the number of nonterminals in linear conjunctive grammars
- Systolic trellis automatat†
- Maximum length cellular automaton sequences and its application
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- Bulking I: An abstract theory of bulking
- Real time recognition with cellular automata : a meaningful example
- Linear speed-up for cellular automata synchronizers and applications
- On time reduction and simulation in cellular spaces
- On the equivalence of linear conjunctive grammars and trellis automata
- On iterative and cellular tree arrays
- Two-dimensional cellular automata and their neighborhoods
- Superposable trellis automata
- Parallel turing machines with one-head control units and cellular automata
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs
- Self-verifying Cellular Automata
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Two-dimensional cellular automata recognizer
- On some open problems concerning the complexity of cellular arrays
- Complexity of one-way cellular automata
- Shrinking one-way cellular automata
- Systolic trellis automata: Stability, decidability and complexity
- Fast parallel language recognition by cellular automata
- The complexity of systolic dissemination of information in interconnection networks
- Fault-tolerant schemes for some systolic systems
- Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata
- A linear speed-up theorem for cellular automata
- Real-time pattern generation by one-dimensional cellular automata
- scientific article; zbMATH DE number 3940733 (Why is no real title available?)
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
- Iterative arrays with self-verifying communication cell
- Linear grammars with one-sided contexts and their automaton representation
- Non-deterministic cellular automata and languages
- Low complexity classes of multidimensional cellular automata
- Topological transformations as a tool in the design of systolic networks
- Nondeterministic, probabilistic and alternating computations on cellular array models
This page was built for publication: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692872)
