1. Bargury Y., Makowsky J.A. (1992) The expressive power of transitive closue and 2-way multihead automata. In: Börger E., Jäger G., Büning H.K., Richter M.M. (eds) Computer science logic, CSL ’91, LNCS Vol. 626. Springer, Berlin, pp 1–14
2. Bresnan J., Kaplan R., Peters S., Zaenen A. (1987) Cross-serial dependencies in Dutch. In: Savitch W.J., Bach E., Marsh W., Safran-Naveh G. (eds) The formal complexity of natural language. Reidel, Dordrecht, pp 286–319
3. Cornelle T., Rogers J. (2000) Model theoretic syntax. In: Cheng L., Sybesma R. (eds) The first GLOT international state-of-the article book, SGG (Vol. 48). Mouton de Gruyter, Berlin
4. Courcelle, B. (1990). Graph rewriting: An algebraic and logic approach. In Handbook of theoretical computer science (Vol. B). Amsterdam: Elsevier.
5. Culy C. (1987) The complexity of the vocabulary of Bambara. In: Savitch W., Bach E., Marsch W., Safran-Naveh G. (eds) The formal complexity of natural language. Reidel, Dordrecht, pp 345–351