Abstract
We propose the e-model for leaf languages which complements the known balanced and unbalanced concepts. Inspired by the neutral behavior of rejecting paths of NP machines, we allow transducers to output empty words. The paper explains several advantages of the new model. A central aspect is that it allows us to prove strong gap theorems: For any class $\mathcal{C}$ that is definable in the e-model, either $\mathrm{coUP}\subseteq\mathcal{C}$ or $\mathcal{C}\subseteq\mathrm{NP}$ . For the existing models, gap theorems, where they exist at all, only identify gaps for the definability by regular languages. We prove gaps for the general case, i.e., for the definability by arbitrary languages. We obtain such general gaps for NP, coNP, 1NP, and co1NP. For the regular case we prove further gap theorems for Σ 2 P , Π 2 P , and Δ 2 P . These are the first gap theorems for Δ 2 P . This work is related to former work by Bovet, Crescenzi, and Silvestri, Vereshchagin, Hertrampf et al., Burtschick and Vollmer, and Borchert et al.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
