Pages that link to "Item:Q2563020"
From MaRDI portal
The following pages link to Real-time language recognition by one-dimensional cellular automata (Q2563020):
Displaying 50 items.
- Cellular automata with limited inter-cell bandwidth (Q549704) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- Iterative tree automata (Q796998) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Closure properties of cellular automata (Q818118) (← links)
- Real-time reversible iterative arrays (Q846369) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- Fast language acceptance by shrinking cellular automata (Q1062469) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures (Q1077942) (← links)
- Real-time, pseudo real-time, and linear-time ITA (Q1089799) (← links)
- Two-dimensional iterative arrays: Characterizations and applications (Q1102749) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- Real-time recognition of two-dimensional tapes by cellular automata (Q1143799) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Synchronous to asynchronous transformation of polyautomata (Q1154807) (← links)
- Deterministic one-way simulation of two-way real-time cellular automata and its related problems (Q1166274) (← links)
- Parallel language recognition in constant time by cellular automata (Q1168087) (← links)
- A linear speed-up theorem for cellular automata (Q1193411) (← links)
- On 'forgetful' cellular automata (Q1227707) (← links)
- Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata (Q1230764) (← links)
- Synchronization and computing capabilities of linear asynchronous structures (Q1242906) (← links)
- Classes of formal grammars (Q1248342) (← links)
- (A-)synchronous (non)-deterministic cell spaces simulating each other (Q1253921) (← links)
- Pushdown cellular automata (Q1285588) (← links)
- Two-dimensional cellular automata recognizer (Q1292301) (← links)
- A universal cellular automaton in quasi-linear time and its S-m-n form (Q1314380) (← links)
- One-way cellular automata on Cayley graphs (Q1334667) (← links)
- On optimal solutions to the firing squad synchronization problem (Q1349868) (← links)
- Alternation on cellular automata (Q1390871) (← links)
- Fast one-way cellular automata. (Q1401242) (← links)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- Hierarchies and undecidability results for iterative arrays with sparse communication (Q1656691) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Evolving cellular automata to perform computations: Mechanisms and impediments (Q1817054) (← links)
- Computations on one-dimensional cellular automata (Q1817072) (← links)
- Regular biosequence pattern matching with cellular automata (Q1857024) (← links)
- Real-time recognition of languages on an two-dimensional Archimedean thread (Q1885922) (← links)
- A symbiosis between cellular automata and genetic algorithms (Q2120520) (← links)
- Hierarchical cellular automata for visual saliency (Q2200019) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Iterative arrays with self-verifying communication cell (Q2278569) (← links)
- Finite turns and the regular closure of linear context-free languages (Q2384399) (← links)
- A study on learning robustness using asynchronous 1D cellular automata rules (Q2629939) (← links)
