Pages that link to "Item:Q818118"
From MaRDI portal
The following pages link to Closure properties of cellular automata (Q818118):
Displaying 7 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Languages not recognizable in real time by one-dimensional cellular automata (Q955338) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
