A new subclass of EOL languages is introduced. Several properties of languages in this class are proved and then applied to provide elegant proofs that some languages are not EOL languages.
Ehrenfeucht, Andrzej and Rozenberg, Grzegorz, "On THETA-Determined EOL Languages ; CU-CS-067-75" (1975). Computer Science Technical Reports. 65.