Pages that link to "Item:Q1193411"

The following pages link to A linear speed-up theorem for cellular automata (Q1193411):

Displaying 15 items.

• Inducing an order on cellular automata by a grouping operation (Q1283794) (← links)
• On the complexity of deadlock detection in families of planar nets (Q1285587) (← links)
• Two-dimensional cellular automata recognizer (Q1292301) (← links)
• A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
• Linear speed-up for cellular automata synchronizers and applications (Q1389648) (← links)
• Alternation on cellular automata (Q1390871) (← links)
• Two-dimensional cellular automata and deterministic on-line tessalation automata (Q1399986) (← links)
• Parallel recognition of rational languages in plane cellular automata (Q1603694) (← links)
• Computations on one-dimensional cellular automata (Q1817072) (← links)
• Two-dimensional cellular automata and their neighborhoods (Q1884945) (← links)
• A single-copy minimal-time simulation of a torus of automata by a ring of automata (Q2384397) (← links)
• Constant Acceleration Theorem for Extended von Neumann Neighbourhoods (Q3186481) (← links)
• Different time solutions for the firing squad synchronization problem on basic grid networks (Q3431435) (← links)
• Synchronization of 1-way connected processors (Q5055943) (← links)
• A simulation of cellular automata on hexagons by cellular automata on rings (Q5941515) (← links)