Abstract
I demonstrate that Merge-over-Move (MOM), a transderivational constraint (TC) put forward in Chomsky (1995, 2000), can be modeled by *linear tree transducers*, i.e.\ machines that take a tree as input and traverse it from the leaves towards the root while at …

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

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