Pages that link to "Item:Q1075053"
From MaRDI portal
The following pages link to Fast parallel language recognition by cellular automata (Q1075053):
Displaying 29 items.
- Parallel learning of automatic classes of languages (Q329605) (← links)
- A note on time-bounded bottom-up pyramid cellular acceptors (Q918727) (← links)
- Fast reversible language recognition using cellular automata (Q948083) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- Fast language acceptance by shrinking cellular automata (Q1062469) (← 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)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- Parallel recognition of rational languages in plane cellular automata (Q1603694) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- A symbiosis between cellular automata and genetic algorithms (Q2120520) (← links)
- Complexity-theoretic aspects of expanding cellular automata (Q2278565) (← links)
- A study on learning robustness using asynchronous 1D cellular automata rules (Q2629939) (← links)
- A characterization of constant-time cellular automata computation (Q2640353) (← links)
- On tally languages and generalized interacting automata (Q2708975) (← links)
- A speed-up of oblivious multi-head finite automata by cellular automata (Q3113692) (← links)
- (Q3700860) (← links)
- Cellular automata on trees, a model for parallel computation (Q3989948) (← links)
- On time reduction and simulation in cellular spaces (Q4261194) (← links)
- (Q4294242) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- (Q4799371) (← links)
- (Q4837658) (← links)
- A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms (Q4931237) (← 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)