Abstract
In [BCS92] it was shown that several well-known complexity classes which have a complete set for every relativization can be characterized by an acceptance language for the words of ouputs produced by a nondeterministic polynomial time computation. In [HL*93] some results were shown for classes for which this acceptance language is regular. Here a partial order on relativizable classes is presented which reflects the idea of oracle independent inclusion. The main result will be that this partial order on the classes characterized by regular languages is atomic and therefore not dense. The atoms correspond to the classes NP, co-NP and MODpP for p prime.
Cite
CITATION STYLE
Borchert, B. (1994). On the acceptance power of regular languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 533–541). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_169
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
