On real-time cellular automata and trellis automata
From MaRDI portal
(Redirected from Publication:790615)
Recommendations
Cited in
(64)- On some open problems concerning the complexity of cellular arrays
- Hierarchies and undecidability results for iterative arrays with sparse communication
- On time reduction and simulation in cellular spaces
- On hardest languages for one-dimensional cellular automata
- Real-Time Prime Generators Implemented on Small-State Cellular Automata
- Inductive definitions in logic versus programs of real-time cellular automata
- A survey of two-dimensional automata theory
- Biologically unavoidable sequences
- Complexity of one-way cellular automata
- Closure properties of cellular automata
- On the equivalence of linear conjunctive grammars and trellis automata
- Signals in one-dimensional cellular automata
- Fast one-way cellular automata.
- Languages not recognizable in real time by one-dimensional cellular automata
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- Synthesis, structure and power of systolic computations
- The complexity of systolic dissemination of information in interconnection networks
- scientific article; zbMATH DE number 4072416 (Why is no real title available?)
- On real time one-way cellular array
- Bulking I: An abstract theory of bulking
- Variations of the firing squad problem and applications
- One-dimensional pattern generation by cellular automata
- Fault-tolerant schemes for some systolic systems
- scientific article; zbMATH DE number 17546 (Why is no real title available?)
- Low complexity classes of multidimensional cellular automata
- Recognition of poly-slender context-free languages by trellis automata
- A linear speed-up theorem for cellular automata
- scientific article; zbMATH DE number 3878386 (Why is no real title available?)
- Computations on one-dimensional cellular automata
- Topological transformations as a tool in the design of systolic networks
- The hardest linear conjunctive language
- Relating the power of cellular arrays to their closure properties
- Efficient unidimensional universal cellular automaton
- Real time recognition with cellular automata : a meaningful example
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Superposable trellis automata
- A universal cellular automaton in quasi-linear time and its S-m-n form
- Boolean grammars
- Constructible functions in cellular automata and their applications to hierarchy results
- One-dimensional pattern generation by cellular automata
- Achieving universal computations on one-dimensional cellular automata
- Real-time, pseudo real-time, and linear-time ITA
- Optimal simulation of tree arrays by linear arrays
- On the number of nonterminals in linear conjunctive grammars
- On iterative and cellular tree arrays
- Two-dimensional cellular automata and deterministic on-line tessalation automata
- Self-verifying Cellular Automata
- Language not recognizable in real time by one-way cellular automata
- Linear speed-up for cellular automata synchronizers and applications
- Cellular automata with sparse communication
- Theory of cellular automata: a survey
- One-way cellular automata on Cayley graphs
- Some results on time-varying and relativised cellular automata*
- Real-time reversible one-way cellular automata
- Iterative tree automata
- Different time solutions for the firing squad synchronization problem on basic grid networks
- A property of real-time trellis automata
- Non-deterministic cellular automata and languages
- Pushdown cellular automata
- On hardest languages for one-dimensional cellular automata
- Grids and universal computations on one-dimensional cellular automata
- Iterative tree arrays with logarithmic depth†
- Language classes defined by time-bounded relativised cellular automata
This page was built for publication: On real-time cellular automata and trellis automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790615)
