Regular paper
On input read-modes of alternating Turing machines

https://doi.org/10.1016/0304-3975(94)00253-FGet rights and content
Under an Elsevier user license
open archive

Abstract

A number of input read-modes of Turing machines have appeared in the literature. To investigate the differences among these input read-modes, we study log-time alternating Turing machines of constant alternations. For each fixed integer k ⩾ 1 and for each read-mode, a precise circuit characterization is established for log-time alternating Turing machines of k alternations, which is a nontrivial refinement of Ruzzo's circuit characterization of alternating Turing machines. These circuit characterizations indicate clearly the differences among the input read-modes. Complete languages in strong sense for each level of the log-time hierarchy are presented, refining a result by Buss. An application of these results to computational optimization problems is described.

Cited by (0)

Supported in part by the National Science Foundation under Grant CCR-9110824 and by Engineering Excellence Award from Texas A&M University.