Empty Alternation

نویسندگان

  • Klaus-Jörn Lange
  • Klaus Reinhardt
چکیده

We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape before making an alternating transition. In particular, we consider the cases when the depth of alternation is bounded by a constant or a polylogarithmic function. In this way we get new characterizations of the classes AC, SAC and P using a push-down store and new characterizations of the class ΘP2 using Turing tapes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Algorithm for the t-Threshold Set Problem

Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We present a new deterministic algorithm for it and prove that, asymptotically in the sizes of the arrays, it is optimal in the alternation model used to study adaptive algorithms. We define the Opt-Threshold problem as fin...

متن کامل

Analysis of the effects of frontal lesions in monkey. III. Object alternation.

11, Results from the earlier studies in this series (4, 5) demonstrated that animals with anterolateral frontal lesions may achieve remarkably high levels of performance on certain variations of delayed alternation and delayed response. In one particularly effective variation of delayed response, a single, centered cup was used: the animals were trained to approach the cup to obtain food if Obj...

متن کامل

On FO2 Quantifier Alternation over Words

We show that each level of the quantifier alternation hierarchy within FO[<] on words is a variety of languages. We use the notion of condensed rankers, a refinement of the rankers defined by Weis and Immerman, to produce a decidable hierarchy of varieties which is interwoven with the quantifier alternation hierarchy – and conjecturally equal to it. It follows that the latter hierarchy is decid...

متن کامل

Counting and empty alternating pushdown automata

We show that the class of context free languages CFL is not equal to ⊕1−PDA (= ⊕CFL), the class of languages, which are recognized by a nondeterministic oneway push-down automaton equipped with parity acceptance. Furthermore we show that LOG(⊕CFL) = ⊕AuxPDApt contains all languages, which can be recognized by a uniform weak unambiguous AC1-circuit introduced in [LR90a]. Therefore, it contains a...

متن کامل

Prevalence of empty sella syndrome

Background: The empty sella syndrome (ESS) is a neurological or pathologic finding in which sella turcica is devoid of pituitary tissue and the subarachnoid space extends into sella turcica, which is either primary or secondary as well as partial and complete. The widespread use of CT scans and MRIs today has made the ESS a common finding in imaging. The aim of this study was to evaluate the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994