A new type of grammar for generating formal languages, called a conditional grammar is presented. A conditional grammar generates the language in a deterministic way and its operation resembles that of a program. Classes of languages generated by some subclasses of conditional grammars are investigated and related to known classes of languages
We propose to set the grammatical inference problem in a logical framework. The search for admissibl...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
This paper discusses some student projects involving generative grammars. While grammars are usual...
A new type of grammar for generating formal languages, called a conditional grammar is presented. A ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
There is currently considerable interest among computational linguists in grammatical formalisms wit...
. We investigate three dierent aspects of external contextual languages, focusing mainly on linear ...
A weakly conditional grammar is specified as a pair K = (G, G′) where G is a context-free grammar, a...
In this paper, we will try to show how CF-grammars can be constructed to describe sets of strings;* ...
AbstractThis paper deals with the problem of computing relations from their abstract non-algorithmic...
The classical definition of the grammatical inference problem is to find a grammar for a language, g...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
The concept of grammar inheritance is introduced. Grammar inheritance is a structural organization o...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We propose to set the grammatical inference problem in a logical framework. The search for admissibl...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
This paper discusses some student projects involving generative grammars. While grammars are usual...
A new type of grammar for generating formal languages, called a conditional grammar is presented. A ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
There is currently considerable interest among computational linguists in grammatical formalisms wit...
. We investigate three dierent aspects of external contextual languages, focusing mainly on linear ...
A weakly conditional grammar is specified as a pair K = (G, G′) where G is a context-free grammar, a...
In this paper, we will try to show how CF-grammars can be constructed to describe sets of strings;* ...
AbstractThis paper deals with the problem of computing relations from their abstract non-algorithmic...
The classical definition of the grammatical inference problem is to find a grammar for a language, g...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
The concept of grammar inheritance is introduced. Grammar inheritance is a structural organization o...
One of the difficulties in the analysis of context-free grammars (and therefore languages) is the st...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
We propose to set the grammatical inference problem in a logical framework. The search for admissibl...
A mathematical formulation of probabilistic grammars, as well as the random languages generated by p...
This paper discusses some student projects involving generative grammars. While grammars are usual...
DOI
Add to ORKG