Add to ORKGMichaelis J, Mönnich U, Morawietz F. Derivational Minimalism in Two Regular and Logical Steps. In: Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5). Paris; 2000: 163-170
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Abstract. Stabler proposes an implementation of the Chomskyan Min-imalist Program, [1] with Minimali...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimali...
AbstractIn this paper we show that non-context-free phenomena can be captured using only limited log...
Vijay-Shanker et al. (1987) note that many inter-esting linguistic formalisms can be thought of as h...
Abstract. Minimalist grammars are a mildly context-sensitive gram-mar framework within which analyse...
Vijay-Shanker et al. (1987) note that many interesting linguistic formalisms can be thought of as ha...
The type of a minimalist grammar (MG) as introduced by Stabler [12] provides an attempt of a rigoro...
AbstractDeviating from the definition originally presented in [12], Stabler [13] introduced—inspired...
AbstractWe explore the use of weak monadic second-order languages over structures of varying dimensi...
In this paper, we aim at understanding the derivations of minimalist grammars without the shortest m...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
AbstractModel theoretic syntax is concerned with studying the descriptive complexity of grammar form...
Abstract. The type of a minimalist grammar (MG) as introduced by Stabler [11, 12] provides an attemp...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Abstract. Stabler proposes an implementation of the Chomskyan Min-imalist Program, [1] with Minimali...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...
In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimali...
AbstractIn this paper we show that non-context-free phenomena can be captured using only limited log...
Vijay-Shanker et al. (1987) note that many inter-esting linguistic formalisms can be thought of as h...
Abstract. Minimalist grammars are a mildly context-sensitive gram-mar framework within which analyse...
Vijay-Shanker et al. (1987) note that many interesting linguistic formalisms can be thought of as ha...
The type of a minimalist grammar (MG) as introduced by Stabler [12] provides an attempt of a rigoro...
AbstractDeviating from the definition originally presented in [12], Stabler [13] introduced—inspired...
AbstractWe explore the use of weak monadic second-order languages over structures of varying dimensi...
In this paper, we aim at understanding the derivations of minimalist grammars without the shortest m...
AbstractContext-free tree grammars, originally introduced by Rounds [Math. Systems Theory 4(3) (1970...
AbstractModel theoretic syntax is concerned with studying the descriptive complexity of grammar form...
Abstract. The type of a minimalist grammar (MG) as introduced by Stabler [11, 12] provides an attemp...
Investigations of classes of grammars that are nontransformational and at the same time highly const...
Abstract. Stabler proposes an implementation of the Chomskyan Min-imalist Program, [1] with Minimali...
the date of receipt and acceptance should be inserted later Abstract The equivalence of leaf languag...