Skip to main content
Conference Proceedings

There does not exist a minimal full trio with respect to bounded context-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6795 LNCS 312-323
DOI: 10.1007/978-3-642-22321-1_27
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We solve an old conjecture of Autebert et al. [1] saying that there does not exist any minimal full trio with respect to bounded context-free languages. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kortelainen, J., & Salmi, T. (2011). There does not exist a minimal full trio with respect to bounded context-free languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6795 LNCS, pp. 312–323). https://doi.org/10.1007/978-3-642-22321-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free