Ilie, L., G. Rozenberg, and A. Salomaa, A characterization of poly-slender context-free languages, Theor. Inform. Appl. 34 (2000), 77-86. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On Universally Easy Classes for NP-complete Problems - Demaine.. (2001) (Correct)
....is universally polynomial, then P = NP. Note that the property of interlacing cycles for regular languages, and hence easiness, can be tested in polynomial time. 4 Open Problems Recently the sparse exponential density property in Theorem 3. 2 has been generalized to context free languages [3, 4]. We conjecture that our results also generalize to CFLs; the main obstruction is in nding a polynomially constructive proof. ....
L. Ilie, G. Rozenberg, and A. Salomaa. A characterization of poly-slender context-free languages. Theoret. Informatics Appl., 34(1):77-86, 2000.
Chomsky-Schützenberger Type Characterizations of Poly-Slender.. - Ito, al. (2001) (Correct)
No context found.
Ilie, L., G. Rozenberg, and A. Salomaa, A characterization of poly-slender context-free languages, Theor. Inform. Appl. 34 (2000), 77-86.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC