Two-dimensional alternating turing machines with only universal states

From MaRDI portal
Publication:3221411

DOI10.1016/S0019-9958(82)90572-1zbMath0557.68037OpenAlexW2088973818MaRDI QIDQ3221411

Itsuo Takanami, K. Inone, Hiroshi Taniguchi, Akira Ito

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(82)90572-1



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (21)

Three-way two-dimensional finite automata with rotated inputsSimulation of three-dimensional one-marker automata by five-way Turing machinesAlternating on-line Turing machines with only universal states and small space boundsA survey of two-dimensional automata theoryA note on three-way two dimensional alternating Turing machinesOn the power of nondeterminism and Las Vegas randomization for two-dimensional finite automataLower bounds for language recognition on two-dimensional alternating multihead machinesThree-dimensional alternating Turing machines with only universal statesA note on one-pebble two-dimensional Turing machinesSome properties of space-bounded synchronized alternating Turing machines with universal states onlyOptimal simulation of two-dimensional alternating finite automata by three-way nondeterministic Turing machinesA note on one-pebble two-dimensional Turing machinesA hierarchy result for 2-dimensional TM's operating in small spaceOn space-bounded synchronized alternating Turing machinesA Survey on Picture-Walking AutomataA leaf-time hierarchy of two-dimensional alternating turing machinesDeterministic two-dimensional on-line tessellation acceptors are equivalent to two-way two-dimensional alternating finite automata through 180\(\circ\)-rotationTwo-dimensional alternative Turing machinesA space-hierarchy result on two-dimensional alternating Turing machines with only universal statesA note on three-dimensional alternating Turing machines with space smaller than \(\log m\)Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata




This page was built for publication: Two-dimensional alternating turing machines with only universal states