Add to ORKGAbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Proceedings of the Tenth Annual Meeting of the Berkeley Linguistics Society (1984), pp. 285-29
10.1007/978-3-642-29952-0_41Lecture Notes in Computer Science (including subseries Lecture Notes in ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
A characterization theorem is given for a class of developmental languages. The theorem binds togeth...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
A family of languages is called arithmetic if each infinite language in it is such that its length s...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL sys...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
High level computer programming languages have been an important influence on computer science since...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Proceedings of the Tenth Annual Meeting of the Berkeley Linguistics Society (1984), pp. 285-29
10.1007/978-3-642-29952-0_41Lecture Notes in Computer Science (including subseries Lecture Notes in ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
A characterization theorem is given for a class of developmental languages. The theorem binds togeth...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
A family of languages is called arithmetic if each infinite language in it is such that its length s...
This paper provides a method of decomposing a subclass of ETOL languages into deterministic ETOL lan...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL sys...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
This paper is concerned with deterministic ETOL languages. A theorem is proved which, roughly speaki...
High level computer programming languages have been an important influence on computer science since...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
Proceedings of the Tenth Annual Meeting of the Berkeley Linguistics Society (1984), pp. 285-29
10.1007/978-3-642-29952-0_41Lecture Notes in Computer Science (including subseries Lecture Notes in ...