Skip to main content
Conference Proceedings

Ogden's Lemma for ET0L languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7183 LNCS 458-467
DOI: 10.1007/978-3-642-28332-1_39
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop a necessary condition for ET0L languages inspired by Ogden's Lemma. Besides being useful for proving that individual languages are not ET0L languages, this result also gives an alternative proof of Ehrenfeucht and Rozenberg's theorem about rare and nonfrequent symbols in ET0L languages. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Rabkin, M. (2012). Ogden’s Lemma for ET0L languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 458–467). https://doi.org/10.1007/978-3-642-28332-1_39

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