Pages that link to "Item:Q794169"
From MaRDI portal
The following pages link to Two-dimensional alternative Turing machines (Q794169):
Displaying 23 items.
- Optimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machines (Q673641) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- A note on time-bounded bottom-up pyramid cellular acceptors (Q918727) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- A space-hierarchy result on two-dimensional alternating Turing machines with only universal states (Q1057650) (← links)
- Alternating simple multihead finite automata (Q1058853) (← links)
- A note on three-way two dimensional alternating Turing machines (Q1112612) (← links)
- Lower bounds for language recognition on two-dimensional alternating multihead machines (Q1124335) (← links)
- Three-dimensional alternating Turing machines with only universal states (Q1129412) (← links)
- A hierarchy result for 2-dimensional TM's operating in small space (Q1193691) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← links)
- A note on three-dimensional alternating Turing machines with space smaller than \(\log m\) (Q1310925) (← links)
- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata (Q1318689) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
- Deterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotation (Q1822982) (← links)
- Non-closure property of space-bounded two-dimensional alternating Turing machines (Q1857029) (← links)
- Three-way two-dimensional alternating finite automata with rotated inputs (Q2489224) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- A Survey on Picture-Walking Automata (Q3098039) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)