It is demonstrated that the degree of ambiguity of a context free language K in the class of EOL systems is not larger than the degree of ambiguity of K in the class of context free grammars. A language K is said to have the negative prefix property if no word K catenated with a nonempty prefix of a word from K+ yields an element of K. It is shown that if an EOL language has the negative prefix property and is EOL-unambiguous then K+ is also EOL-unambiguous. Using those results several conjectures concerning ambiguity of EOL languages are disproved
We give an example of minimal linear language, all of whose minimal linear grammars are ambiguous; t...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
In this paper I will show that whenever a language has a negative marker that is a syntactic head, t...
AbstractAn E0L system G is called ambiguous if its language contains a word with (at least) two diff...
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 ...
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...
In the area of computer science and others grammars play a vital role from both theoretical and prac...
In the area of computer science and others grammars play a vital role from both theoretical and prac...
In this paper we discus the concept of ambiguity of context–free languages and grammars. We prove th...
AbstractBoolean grammars are an extension of context-free grammars, in which conjunction and negatio...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
AbstractThe inherent ambiguity question for context-free languages is shown to be in the Turing degr...
A context-free grammar G is ambiguous if and only if there is a word that can be generated by G with...
We give an example of minimal linear language, all of whose minimal linear grammars are ambiguous; t...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
In this paper I will show that whenever a language has a negative marker that is a syntactic head, t...
AbstractAn E0L system G is called ambiguous if its language contains a word with (at least) two diff...
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 ...
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...
In the area of computer science and others grammars play a vital role from both theoretical and prac...
In the area of computer science and others grammars play a vital role from both theoretical and prac...
In this paper we discus the concept of ambiguity of context–free languages and grammars. We prove th...
AbstractBoolean grammars are an extension of context-free grammars, in which conjunction and negatio...
It is shown that there exist context free languages which are not deterministic ETOL languages. The ...
AbstractThe inherent ambiguity question for context-free languages is shown to be in the Turing degr...
A context-free grammar G is ambiguous if and only if there is a word that can be generated by G with...
We give an example of minimal linear language, all of whose minimal linear grammars are ambiguous; t...
AbstractOne of the useful results concerning EOL languages states that a language is an EOL language...
In this paper I will show that whenever a language has a negative marker that is a syntactic head, t...