The following pages link to On real time one-way cellular array (Q673792):
Displaying 31 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- 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)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Closure properties of cellular automata (Q818118) (← links)
- Low complexity classes of multidimensional cellular automata (Q861257) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- Pushdown cellular automata (Q1285588) (← links)
- Language not recognizable in real time by one-way cellular automata (Q1351802) (← links)
- Fast one-way cellular automata. (Q1401242) (← links)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Theory of cellular automata: a survey (Q1779295) (← links)
- Boolean grammars (Q1886037) (← links)
- Language equations (Q2074222) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- Complexity of One-Way Cellular Automata (Q5501608) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- Edit distance neighbourhoods of input-driven pushdown automata (Q5920214) (← links)
- Constructible functions in cellular automata and their applications to hierarchy results (Q5958331) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
