Any recursively enumerable language is generated by a transformational grammar with a type 3 base of trees and with no ordering or control device for the transformations. Furthermore, the set of transformation rules depends on the alphabet alone
This paper presents new models for all recursive enumerable languages. These models are based on mul...
Abstract A familiar argument goes as follows: natural languages have infinitely many sentences, fini...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
Any recursively enumerable language is generated by a transformational grammar with a type 3 base of...
ABSTRACT. Various restrictions on transformational grammars have been investigated in order to reduc...
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists ...
The generative capacity of the compound grammars is investigated. We shall prove that the compositio...
Abstract. The generative conception of grammars relies on the derivation process which, to its turn,...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
Two new classes of generative grammars are defined. The first class, the compound grammars, consists...
A concept of a generalized grammar with an enumerable set of productions is introduced. Some of the ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
In Moortgat 1996 the Lambek Calculus L (Lambek 1958) is extended by a pair of residuation modalities...
This paper discusses grammar systems that have only terminals, work in the leftmost way, and generat...
This paper presents new models for all recursive enumerable languages. These models are based on mul...
Abstract A familiar argument goes as follows: natural languages have infinitely many sentences, fini...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
Any recursively enumerable language is generated by a transformational grammar with a type 3 base of...
ABSTRACT. Various restrictions on transformational grammars have been investigated in order to reduc...
Mathematical modeling of phrase structure grammars has yielded many results of benefit to linguists ...
The generative capacity of the compound grammars is investigated. We shall prove that the compositio...
Abstract. The generative conception of grammars relies on the derivation process which, to its turn,...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
The generative capacity of combinatory categorial grammars (CCGs) as generators of tree languages is...
Two new classes of generative grammars are defined. The first class, the compound grammars, consists...
A concept of a generalized grammar with an enumerable set of productions is introduced. Some of the ...
A conditional grammar is a Chomsky grammar with languages associated to its rules such that each rul...
In Moortgat 1996 the Lambek Calculus L (Lambek 1958) is extended by a pair of residuation modalities...
This paper discusses grammar systems that have only terminals, work in the leftmost way, and generat...
This paper presents new models for all recursive enumerable languages. These models are based on mul...
Abstract A familiar argument goes as follows: natural languages have infinitely many sentences, fini...
summary:First, this paper discusses tree-controlled grammars with root-to-leaf derivation-tree paths...
DOI
Add to ORKG