Pages that link to "Item:Q1168087"

The following pages link to Parallel language recognition in constant time by cellular automata (Q1168087):

Displaying 11 items.

• A logical approach to locality in pictures languages (Q295631) (← links)
• Fast parallel language recognition by cellular automata (Q1075053) (← links)
• Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
• Regular biosequence pattern matching with cellular automata (Q1857024) (← links)
• Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
• Complexity-theoretic aspects of expanding cellular automata (Q2278565) (← links)
• A characterization of constant-time cellular automata computation (Q2640353) (← links)
• On time reduction and simulation in cellular spaces (Q4261194) (← links)
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q5041265) (← links)
• Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (Q6169898) (← links)
• Complexity-theoretic aspects of expanding cellular automata (Q6195134) (← links)