```
@Misc{Graf10Goettingentalk,
author = {Graf, Thomas},
title = {Syntax, Semantics, Pragmatics: Where do we Find
Optimality?},
year = {2010},
note = {Invited talk, December 15, Institut für Anglistik,
Universität Göttingen, Göttingen, Germany}
}
```

# More Output

# Optimality Conditions Could Care Less About Optimality

# 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 ...