Publication:3785943
From MaRDI portal
zbMath0643.68058MaRDI QIDQ3785943
Itsuo Takanami, Juraj Hromkovič, Katsushi Inoue
Publication date: 1987
complexity measure; hierarchy of complexity classes; two-dimensional alternating Turing machines; leaf-size bounded computations
68Q25: Analysis of algorithms and problem complexity
Related Items
Lower bounds for language recognition on two-dimensional alternating multihead machines, A survey of two-dimensional automata theory