#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1997

2012

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Uwe Mönnich
- ArXiv
- 1997

There have been many attempts to give a coherent formulation of a hierarchical progression that would lead to a refined partition of the vast area stretching from the context-free to the context-sensitive languages. The purpose of this note is to describe a theory that seems to afford a promising method of interpreting the tree adjoining languages as the… (More)

- Manfred Sailer, Erhard W. Hinrichs, Friedrich Hamm, Uwe Mönnich, Jürgen Pafel, Tilman Berger
- 2000

- Hans-Peter Kolb, Jens Michaelis, Uwe Mönnich, Frank Morawietz
- Theor. Comput. Sci.
- 2003

The main result of this paper is a description of linguisticallymotivated non-contextfree phenomena equivalently in terms of regular tree languages (to express the recursive properties) and both a logical and an operational perspective (to establish the intended linguistic relations). The result is exemplified with a particular noncontext-free phenomenon,… (More)

- Stephan Kepser, Uwe Mönnich
- Theor. Comput. Sci.
- 2006

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)

- Uwe Mönnich
- 2007

Model-theoretic syntax deals with the logical characterization of complexity classes. The first results in this area were obtained in the early and late Sixties of the last century. In these results it was established that languages recognised by finite string and tree automata are definable by means of monadic second-order logic (MSO). To be slightly more… (More)

- Uwe Mönnich
- TAG
- 2012

Context-free tree grammars, originally introduced by Rounds ((Rounds, 1970)), are powerful grammar devices for the definition of tree languages. In the present paper, we consider a subclass of the class of context-free tree languages, namely the class of monadic simple context-free tree languages. For this class of context-free tree languages, a faithful… (More)

- Hans-Peter Kolb, Uwe Mönnich, Frank Morawietz
- Grammars
- 2000

The main result of this paper is a description of cross-serial dependencies equivalently in terms of (a) regular tree languages (to express the recursive properties) and regular string languages (to establish the intended linguistic relations) and (b) transductions definable in monadic secondorder (MSO) logic which are defined on a domain of finite trees… (More)

- Frank Morawietz, Uwe Mönnich
- Electr. Notes Theor. Comput. Sci.
- 2001

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)

- Uwe Mönnich
- TAG
- 2010

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.

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 treebanks, the prototype of non-relational semistructured… (More)