Formal Language Characterizations of P, NP, and PSPACE
نویسنده
چکیده
Based on the notions of locality and recognizability for n-dimensional languages n-dimensionally colorable 1-dimensional languages are introduced. It is shown: A language L is in NP if and only if L is n-dimensionally colorable for some n. An analogous characterization in terms of deterministic n-dimensional colorability is obtained for P. The addition of one unbounded dimension for coloring leads to a characterization of PSPACE.
منابع مشابه
Notes on Complexity Theory Last updated : October , 2015 Lecture 6
As in our previous study of NP, it is useful to identify those problems that capture the essence of PSPACE in that they are the “hardest” problems in that class. We can define a notion of PSPACE-completeness in a manner exactly analogous to NP-completeness: Definition 1 Language L′ is PSPACE-hard if for every L ∈ PSPACE it holds that L ≤p L′. Language L′ is PSPACE-complete if L′ ∈ PSPACE and L′...
متن کاملAlternating and Empty Alternating Auxiliary Stack Automata
We consider variants of alternating auxiliary stack automata and characterize their computational power when the number of alternations is bounded by a constant or unlimited. In this way we get new characterizations of NP, the polynomial hierarchy, PSpace, and bounded query classes like co-DP=NL〈NP[1]〉 and 2P=P , in a uniform framework. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCircuits, Pebbling and Expressibility
We give characterizations of nondeterministic complexity classes such as NP and PSPACE and the classes in the polynomial time hierarchy in the two-person pebble game model [VT89]. These characterizations motivate the definitions of these classes using firstorder sentences extending the results in [Im82]. It is shown that the role-switches resource in the pebble games closely model the levels of...
متن کاملStrong Reductions and Isomorphism of Complete Sets
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following results. • If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. • If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomo...
متن کاملOn the Power of Polynomial Bit-Reductions
We examine the notion of deenability of complexity classes via leaf languages, introduced a nondeterministic polynomial time Turing machine M and an input string x, the leaf string of M on x is the sequence of output values over all paths (0 for a rejecting, 1 for an accepting path) of the computation of M with input x. A class C is deenable via leaf language B, if for every A 2 C, there exists...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Automata, Languages and Combinatorics
دوره 13 شماره
صفحات -
تاریخ انتشار 2008