Abstract
Minimalist grammars (Stabler 1997) capture some essential
ideas about the basic operations of sentence construction in the
Chomskyian syntactic tradition. Their affinity with the unformalized
theories of working linguists makes it easier to implement and thereby
to better understand the operations appealed to in neatly accounting
for some of the regularities perceived in language. Here we
characterize the expressive power of two, apparently quite different,
variations on the basic minimalist grammar framework, gotten by:
1. adding a mechanism of `feature percolation'
(Kobele, forthcoming), or
2. instead of adding a central constraint on movement (the
`specifier island condition', Stabler 1999), using it to
replace another one (the `shortest move condition',
Stabler 1997, 1999)
(Gärtner & Michaelis 2005).
We demonstrate that both variants have equal, unbounded, computing
power by showing how each can simulate straightforwardly a 2-counter
automaton.