If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes the shuffle of the languages K1 and K2, and a is a symbol not in the alphabet of K). Hence the class of context-free languages is the largest full AFL inside the class of EOL languages
In this paper context-free languages are investigated according to their ordering properties. For th...
It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL sys...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
AbstractIt is demonstrated that every context-free language is a homomorphic image of the intersecti...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
We answer two questions of Van der Walt (Inform. Contr. 32 (1976)): (1) There exists a (context-free...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
Commutative properties in formal languages pose problems at the frontier of computer science, comput...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
Let ℒCI be the family of context-free languages. Two characterization theorems are given for (contex...
In this paper context-free languages are investigated according to their ordering properties. For th...
It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL sys...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(K1, K2) denotes...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
AbstractIt is demonstrated that every context-free language is a homomorphic image of the intersecti...
One of the useful results concerning EOL languages states that a language is an EOL language if and ...
A new subclass of EOL languages is introduced. Several properties of languages in this class are pro...
We answer two questions of Van der Walt (Inform. Contr. 32 (1976)): (1) There exists a (context-free...
AbstractIt is undecidable whether or not a given context-free language and a propagating DT0L langua...
A homomorphism acting on a context-free language L is either e-limited on L, linearly bounded on L, ...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
Commutative properties in formal languages pose problems at the frontier of computer science, comput...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
Let ℒCI be the family of context-free languages. Two characterization theorems are given for (contex...
In this paper context-free languages are investigated according to their ordering properties. For th...
It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL sys...
AbstractThis paper proposes three possible definitions of context-free languages over infinite alpha...
DOI
Add to ORKG