1. Barton, E. G., Berwick, R., & Ristad, E. S. (1987). Computational Complexity and Natural Language. The MIT Press: Bradford Books.
2. Büchi, J. (1960). Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 6, 66–92.
3. Chomsky, N. (1957). Syntactic Structures (2nd ed.). Walter de Gruyter.
4. Chomsky, N. (1965). Aspects of the Theory of Syntax. MIT Press.
5. Cobham, A. (1965). The intrinsic computational difficulty of functions. In Y. Bar-Hillel (Ed.), Proceedings of the 1964 Congress for Logic, Methodology, and the Philosophy of Science (pp. 24–30). Jerusalem: North-Holland Publishing.