Abstract
We introduce dense completeness, which gives tighter connection between formal language classes and complexity classes than the usual notion of completeness. A family of formal languages F is densely complete in a complexity class C iff F ⊆ C and for each C ∈ C there is an F ∈ F such that F is many-one equivalent to C. For AC 0-reductions we show the following results: the family CFL of context-free languages is densely complete in the complexity class SAC 1. Moreover, we show that the indexed languages are densely complete in NP and the nondeterministic one-counter languages are densely complete in NL. On the other hand, we prove that the regular languages are not densely complete in NC 1. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Krebs, A., & Lange, K. J. (2012). Dense completeness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7410 LNCS, pp. 178–189). https://doi.org/10.1007/978-3-642-31653-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
