Abstract
The mathematical results about various classes of transformational grammars continue to play a role in linguistic discussions. Peters and Ritchie (1973a) proved that transformational grammars of the “standard” sort with a context-sensitive base were equivalent to unrestricted rewriting systems (equivalently, Turing machines) in their weak generative capacity, that is, that there was such a grammar for every recursively enumerable language. The proof can be presented informally and is easy to grasp (see Bach, 1974, for an informal presentation of the proof).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bach, Emmon (1974). Syntactic Theory. New York.
Chomsky, Noam (1973). ‘Conditions on Transformations.’ In Stephen R. Anderson and Paul Kiparsky, eds., A Festschrift for Moris Halls.
Cullicover, Peter and Kenneth Wexler (1977). ‘Some Syntactic Implications of a Theory of Language Learnability.’ In P. W. Culicover, T. Wasow, and A. Akmajian: eds., Formal Syntax. New York.
Davis, Martin (1968). Computability and Unsolvability.. New York.
Hamburger, Henry and Kenneth N. Wexler (1973). ‘Identifiability of a Class of Transformational Grammars.’ In K. J. J. Hintikka, J. M. E. Moravcsik, and P. Suppes, eds., Approaches to Natural Language. Dordrecht.
Peters, P. S., Jr. and R. W. Ritchie (1971). ‘On Restricting the Base Component of Transformational Grammars.’ Information and Control, 18: 483–501.
Peters, Stanley and R. W. Ritchie (1973a). ‘On the Generative Power of Transformational Grammars.’ Information Science, 6: 49–83.
Peters, P. Stanley Jr., and R. W. Ritchie (1973b). ‘Nonfiltering and Local-filtering Transformational Grammars.’ In K. J. Hintikka, J. M. E. Moravcsik, and P. Suppes, eds., Approaches to Natural Language. Dordrecht.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 D. Reidel Publishing Company, Dordrecht, Holland
About this chapter
Cite this chapter
Bach, E., Marsh, W. (1987). An Elementary Proof of the Peters-Ritchie Theorem. In: Savitch, W.J., Bach, E., Marsh, W., Safran-Naveh, G. (eds) The Formal Complexity of Natural Language. Studies in Linguistics and Philosophy, vol 33. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3401-6_3
Download citation
DOI: https://doi.org/10.1007/978-94-009-3401-6_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-55608-047-0
Online ISBN: 978-94-009-3401-6
eBook Packages: Springer Book Archive