Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational level. Weak generative capacity is not affected, and while subregular complexity varies betweeen the three proposals, it does not exceed the complexity imposed by Move. The closure of Minimalist derivation tree languages under intersection with regular tree languages, however, is lost.
@InProceedings{Graf14FG,
author = {Graf, Thomas},
title = {Models of Adjunction in {M}inimalist Grammars},
year = {2014},
booktitle = {{F}ormal {G}rammar 2014},
pages = {52--68},
editor = {Morrill, Glynn and Muskens, Reinhard and Osswald, Rainer
and Richter, Frank},
volume = {8612},
series = {Lecture Notes in Computer Science},
address = {Heidelberg},
publisher = {Springer},
doi = {10.1007/978-3-662-44121-3_4},
url = {https://doi.org/10.1007/978-3-662-44121-3_4},
}