Pages that link to "Item:Q3692872"
From MaRDI portal
The following pages link to Sequential Machine Characterizations of Trellis and Cellular Automata and Applications (Q3692872):
Displayed 27 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)
- Low complexity classes of multidimensional cellular automata (Q861257) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- A linear speed-up theorem for cellular automata (Q1193411) (← links)
- Parallel turing machines with one-head control units and cellular automata (Q1285791) (← links)
- Two-dimensional cellular automata recognizer (Q1292301) (← links)
- Linear speed-up for cellular automata synchronizers and applications (Q1389648) (← links)
- Two-dimensional cellular automata and their neighborhoods (Q1884945) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- Fault-tolerant schemes for some systolic systems (Q3804198) (← links)
- On time reduction and simulation in cellular spaces (Q4261194) (← 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)
- Superposable Trellis Automata (Q5096860) (← links)
- Real time recognition with cellular automata : a meaningful example (Q5286058) (← links)
- Complexity of One-Way Cellular Automata (Q5501608) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- Self-verifying Cellular Automata (Q6108530) (← links)
- On some open problems concerning the complexity of cellular arrays (Q6183605) (← links)
- Shrinking one-way cellular automata (Q6191203) (← links)
- Iterative arrays with self-verifying communication cell (Q6195133) (← links)
