#### Filter Results:

#### Publication Year

1997

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Frank Richter, Erhard W Hinrichs, Mitberichterstatter, Uwe Mönnich, Priv Doz, Fritz Hamm +4 others
- 2000

- Uwe Mönnich
- ArXiv
- 1997

This note presents a method of interpreting the tree adjoining languages as the natural third step in a hierarchy that starts with the regular and the context-free languages. The central notion in this account is that of a higher-order substitution. Whereas in traditional presentations of rule systems for abstract language families the emphasis has been on… (More)

Context-free tree grammars, originally introduced by Rounds (1970a), are powerful grammar devices for the definition of tree languages. The properties of the class of context-free tree languages have been studied for more than three decades now. Particularly important here is the work by Engelfriet and Schmidt (1977, 1978). In the present paper, we consider… (More)

The main result of this paper is a description of linguistically motivated non-context-free phenomena equivalently in terms of regular tree languages (to express the re-cursive properties) and both a logical and an operational perspective (to establish the intended linguistic relations). The result is exemplified with a particular non-context-free… (More)

In this paper we extend the work by Michaelis (1999) which shows how to encode an arbitrary Minimalist Grammar in the sense of Stabler (1997) into a weakly equivalent multiple context-free grammar (MCFG). By viewing MCFG rules as terms in a free Lawvere theory we can translate a given MCFG into a regular tree grammar. The latter is characterizable by both a… (More)

In this paper we show that non-context-free phenomena can be captured using only limited logical means. In particular, we show how to encode a Tree Adjoining Grammar [16] into a weakly equivalent monadic context-free tree grammar (MCFTG). By viewing MCFTG-rules as terms in a free Lawvere theory, we can translate a given MCFTG into a regular tree grammar.… (More)

- Edward N Zalta, Bernie Linsky, Greg O 'hair, John Etchemendy, Chris Menzel, Kees Van Deemter +3 others
- 2006

The definitions of propositional modal logic are traditionally formulated in the following way. 1 First, a formal language is defined, usually with atomic formulas p, q,. .. and complex formulas involving the connec-tives ¬, → and the 2 operator. Models M for this language are then defined as triples W, R, V in which W is a nonempty set of worlds, R is an… (More)

One of the fundamental problems when defining a query language for databases consists in finding a balance between the desiderata of a sufficiently large expressive power on the one hand and an adequate computability of queries on the other. This problem occurs of course also with linguistic tree-banks, the prototype of non-relational semistruc-tured… (More)

Well-nested word languages have been advertised as adequate formalizations of the notion of mild context-sensitivity. The main result of this paper is a characterization of well-nested tree languages in terms of simple attributed tree transducers.