1997•Theoretical Computer ScienceOpen access

On the power of alternation on reversal-bounded alternating Turing machines with a restriction

Hiroaki Yamamoto

Open full text 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Turing machine, Alternation (linguistics), Computer science, Description number, DTIME, Bounded function, Universal Turing machine, NSPACE

Related papers

Back to paper searchBrowse research topicsOriginal source
On the power of alternation on reversal-bounded alternating Turing machines with a restriction — Research Paper | ScholarLens