```
@Misc{Graf10ZAStalk,
author = {Graf, Thomas},
title = {Optimality Conditions Could Care Less About Optimality},
year = {2010},
note = {Invited talk, December 10, Zentrum für Allgemeine
Sprachwissenschaft (ZAS), Berlin, Germany}
}
```

# More Output

# Reference-Set Computation = Minimalism + Transformational Rules?

Abstract Transderivational constraints (TC) formed an integral part of the early Minimalist Program. I develop a formal model of TCs firmly rooted in automata theory and subsequently argue that

- in general, TCs aren’t computationally intractable, nor does their complexity exceed that of …

# Efficient Computation at the Interfaces

# Rethinking Transderivationality

Abstract Transderivational constraints (TC) formed an integral part of the early Minimalist Program. I develop a formal model of TCs firmly rooted in automata theory and subsequently argue that

- in general, TCs aren’t computationally intractable, nor does their complexity exceed that of …

# Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems

Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

# Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems

Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

# Concealed Reference-Set Computation or How Syntax Escapes the Parser’s Clutches

Abstract A core assumption of the biolinguistic program is that all properties of language beyond recursion can be motivated by requirements imposed by other cognitive modules. One component in this setup is the parser, which is thought to give rise to a preference …

# Some Interdefinability Results for Syntactic Constraint Classes

Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …

# A Tree Transducer Model of Reference-Set Computation

Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

# Locality in Flux — Reducibility Results for Syntactic Constraints

Abstract Müller and Sternefeld (2000) propose a locality hierarchy of syntactic constraints such that {representational, derivational} < global < translocal < transderivational. We use formal methods to demonstrate that their hierarchy correctly assumes that higher constraint classes are more powerful, but we also show that for …

# Some Interdefinability Results for Syntactic Constraint Classes

Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …