The following pages link to Theory Is Forever (Q5894872):
Displaying 13 items.
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Seas of squares with sizes from a \(\Pi_{1}^{0}\) set (Q1686319) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- Undecidability of the emptiness problem for context-free picture languages (Q2357111) (← links)
- A Survey on Picture-Walking Automata (Q3098039) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)
- On Complexity of Two Dimensional Languages Generated by Transducers (Q3602813) (← links)
- (Q4209252) (← links)
- Transducer generated arrays of robotic nano-arms (Q5962069) (← links)
- Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs (Q6178459) (← links)
