Cover not available
Introduction published In:
Formal Language Theory and its Relevance for Linguistic Analysis
Edited by Diego Gabriel Krivochen
[Evolutionary Linguistic Theory 3:2] 2021
► pp. 123–128

Introduction

| University of Oxford


This article is available free of charge.

Published online: 5 November 2021
DOI logo
https://doi.org/10.1075/elt.00030.kri
References
Ajdukiewicz, K.
(1935) Die syntaktische Konnexität. Studia Philosophica (Warszawa) 11.1–28.Google Scholar
Blevins, J. & Sag, I.
(2013) Phrase structure grammar. In M. den Dikken (ed.) The Cambridge handbook of generative syntax. Cambridge: CUP. 202–225. DOI logoGoogle Scholar
Chomsky, N.
(1956) Three models for the description of language. IRE Transactions on Information Theory (21). 113–124. DOI logoGoogle Scholar
(1965) Aspects of the Theory of Syntax. Cambridge, Mass.: MIT Press.Google Scholar
Chomsky, N. & Miller, G.
(1963) Introduction to the Formal Analysis of Natural Languages. In R. Luce, R. Bush & E. Galanter (eds.), Handbook of Mathematical Psychology (pp. 269–321). New York: Wiley & Sons.Google Scholar
Chomsky, N.
(2015) The Minimalist Program [2nd Edition]. Cambridge, Mass.: MIT Press.Google Scholar
Church, A.
(1936) An unsolvable problem of elementary number theory. American Journal of Mathematics, 581. 345–363. DOI logoGoogle Scholar
Gazdar, G.
(1981) Unbounded dependencies and coordinate structure. Linguistic Inquiry 121. 155–184.Google Scholar
Gazdar, G., Klein, E., Pullum, G. & Sag, I.
(1985) Generalized Phrase Structure Grammar. Cambridge, Mass.: Harvard University Press.Google Scholar
Hamblin, C. L.
(1973) Questions in Montague English. Foundations of Language 10 (1). 41–53.Google Scholar
Joshi, A. K.
(1985) Tree adjoining grammars. In D. Dowty, L. Karttunen & A. Zwicky (eds.) Natural Language Parsing (pp. 206–250). Cambridge, Mass.: CUP. DOI logoGoogle Scholar
(2011) Review: Formal grammars in linguistics and psycholinguistics, vol. 1: An introduction to the theory of formal languages and automata by Willem J. M. Levelt. Language 87(2). 414–416. DOI logoGoogle Scholar
Joshi, A. K., Levy, L. & Takahashi, M.
(1975) Tree adjunct grammars. Journal of the Computer and System Sciences 10(1). 136–163. DOI logoGoogle Scholar
Heinz, J.
(2018) The computational nature of phonological generalizations. In L. Hyman & F. Plank (Eds.), Phonological typology: Phonetics and phonology (pp. 126–195). Berlin: Mouton De Gruyter. DOI logoGoogle Scholar
Kroch, A. & Joshi, A. K.
(1985) Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85-18, Department of Computer and Information Science, University of Pennsylvania. Available online at: [URL]
Langendoen, D. T.
(1975) Finite-State Parsing of Phrase-Structure Languages and the Status of Readjustment Rules in Grammar. Linguistic Inquiry, 6(4). 533–554.Google Scholar
Langendoen, T. & Postal, P.
(1984) The Vastness of Natural Languages. Oxford: Blackwell.Google Scholar
Lyons, J.
(1968) Introduction to theoretical linguistics. Cambridge: Academic Press. DOI logoGoogle Scholar
Maling, J. & Zaenen, A.
(1982) A Phrase Structure Account of Scandinavian Extraction Phenomena. In P. Jacobson & G. Pullum (eds.) The nature of syntactic representation. Dordrecht: Reidel. 229–282. DOI logoGoogle Scholar
Montague, R.
(1973) The proper treatment of quantification in ordinary English. In J. Hintikka, J. Moravcsik & P. Suppes (eds.), Approaches to natural language (pp. 221–242). Dordrecht: Reidel. DOI logoGoogle Scholar
Partee, B.
(1975) Montague Grammar and Transformational Grammar. Linguistic Inquiry 6(2). 203–300.Google Scholar
Peters, S. & Ritchie, R. W.
(1973) On the generative power of transformational grammars. Information Sciences 61. 49–83. DOI logoGoogle Scholar
Pollard, C.
(1984) Generalized Context Free Grammars, Head Grammars, and Natural Languages. Ph.D. thesis, Stanford University.
Post, E.
(1943) Formal Reductions of the General Combinatorial Decision Problem. American Journal of Mathematics, 65(2). 197–215. DOI logoGoogle Scholar
Reich, P.
(1969) The finiteness of natural language. Language 45(4). 831–843. DOI logoGoogle Scholar
Swanson, B., Yamangil, E., Charniak, E. & Shieber, S.
(2013) A Context Free TAG Variant. Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 302–310.Google Scholar
Turing, A.
(1936) On Computable Numbers, with an Application to the Entscheidungsproblem, Proc. London Math. Soc. 42(2). 230–265.Google Scholar