The following pages link to (Q4699286):
Displayed 5 items.
- Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Cold dynamics in cellular automata: a tutorial (Q6137192) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)