Pages that link to "Item:Q790615"
From MaRDI portal
The following pages link to On real-time cellular automata and trellis automata (Q790615):
Displayed 44 items.
- Bulking I: An abstract theory of bulking (Q549700) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- On real time one-way cellular array (Q673792) (← links)
- Iterative tree automata (Q796998) (← links)
- Closure properties of cellular automata (Q818118) (← links)
- Low complexity classes of multidimensional cellular automata (Q861257) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- The hardest linear conjunctive language (Q1007613) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- A property of real-time trellis automata (Q1079372) (← links)
- Real-time, pseudo real-time, and linear-time ITA (Q1089799) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- Variations of the firing squad problem and applications (Q1116339) (← links)
- Optimal simulation of tree arrays by linear arrays (Q1120283) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- A linear speed-up theorem for cellular automata (Q1193411) (← links)
- Pushdown cellular automata (Q1285588) (← links)
- Signals in one-dimensional cellular automata (Q1285793) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- One-way cellular automata on Cayley graphs (Q1334667) (← links)
- Language not recognizable in real time by one-way cellular automata (Q1351802) (← links)
- Linear speed-up for cellular automata synchronizers and applications (Q1389648) (← links)
- Two-dimensional cellular automata and deterministic on-line tessalation automata (Q1399986) (← links)
- Fast one-way cellular automata. (Q1401242) (← links)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Computations on one-dimensional cellular automata (Q1817072) (← links)
- Boolean grammars (Q1886037) (← links)
- Cellular automata with sparse communication (Q1959660) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
- Iterative tree arrays with logarithmic depth<sup>†</sup> (Q3802619) (← links)
- Fault-tolerant schemes for some systolic systems (Q3804198) (← links)
- Some results on time-varying and relativised cellular automata<sup>*</sup> (Q4016899) (← links)
- On time reduction and simulation in cellular spaces (Q4261194) (← links)
- Language classes defined by time-bounded relativised cellular automata (Q4288203) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- Achieving Universal Computations on One-Dimensional Cellular Automata (Q4931277) (← links)
- Real time recognition with cellular automata : a meaningful example (Q5286058) (← links)
- Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)