Pages that link to "Item:Q2563020"

The following pages link to Real-time language recognition by one-dimensional cellular automata (Q2563020):

Displaying 25 items.

• A survey of two-dimensional automata theory (Q2638801) (← links)
• A characterization of constant-time cellular automata computation (Q2640353) (← links)
• Non-deterministic cellular automata and languages (Q2869781) (← links)
• Constant Acceleration Theorem for Extended von Neumann Neighbourhoods (Q3186481) (← links)
• (Q3339293) (← links)
• Exemples de classes d'automates cellulaires (Q3514633) (← links)
• Fault-tolerant schemes for some systolic systems (Q3804198) (← links)
• Estimates of the operating time of stable iterative, language-modeling, and recognition systems (Q3817615) (← links)
• The notion of a probabilistic cellular acceptor (Q3862454) (← links)
• Some results on time-varying and relativised cellular automata^* (Q4016899) (← links)
• On time reduction and simulation in cellular spaces (Q4261194) (← links)
• Language classes defined by time-bounded relativised cellular automata (Q4288203) (← links)
• On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
• A Study on the Automatic Generation of Asynchronous Cellular Automata Rules by Means of Genetic Algorithms (Q4931237) (← links)
• Real-Time Prime Generators Implemented on Small-State Cellular Automata (Q4983004) (← links)
• Efficient unidimensional universal cellular automaton (Q5096850) (← links)
• Complexity of One-Way Cellular Automata (Q5501608) (← links)
• Language Recognition by Reversible Partitioned Cellular Automata (Q5501617) (← links)
• Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)
• Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
• One-dimensional pattern generation by cellular automata (Q6137186) (← links)
• Hierarchies and undecidability results for iterative arrays with sparse communication (Q6151193) (← links)
• On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
• Iterative arrays with self-verifying communication cell (Q6195133) (← links)
• \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)