AbstractOne of the useful results concerning EOL languages states that a language is an EOL language if and only if it is a cording of OL language. In this paper we retine this result by demonstrating that there exist EOL languages that are not codings of languages that are generated by propagating OL systems with finite axiom sets. This solves Problem 10 from the L Systems Problem Book '75
AbstractThe following morphic characterization of EOL languages is established. The family of EOL la...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractAn E0L system G is called ambiguous if its language contains a word with (at least) two diff...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
AbstractThe following morphic characterization of EOL languages is established. The family of EOL la...
We establish two types of normal forms for EOL systems. We first show that each ε-free EOL language ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
E0L-languages arose in the study of developmental systems in biology. In this paper we characterize ...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
AbstractWe characterize a special class of developmental languages generated by unary 〈1, 0〉 systems...
AbstractThe following morphic characterization of EOL languages is established. The family of EOL la...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractAn E0L system G is called ambiguous if its language contains a word with (at least) two diff...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and...
AbstractThe following morphic characterization of EOL languages is established. The family of EOL la...
We establish two types of normal forms for EOL systems. We first show that each ε-free EOL language ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
E0L-languages arose in the study of developmental systems in biology. In this paper we characterize ...
AbstractThis paper provides a method of “decomposing” a subclass of ET0L languages into deterministi...
AbstractWe characterize a special class of developmental languages generated by unary 〈1, 0〉 systems...
AbstractThe following morphic characterization of EOL languages is established. The family of EOL la...
This paper provides a method of ''decomposing'' a subclass of ETOL languages into deterministic ETO...
AbstractAn E0L system G is called ambiguous if its language contains a word with (at least) two diff...
DOI
Add to ORKG