×

zbMATH — the first resource for mathematics

On the generative power of transformational grammars. (English) Zbl 0251.68045

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chomsky, Noam, Aspects of the theory of syntax, (1965), M.I.T. Press Cambridge · Zbl 0183.00604
[2] Chomsky, Noam, Current issues in linguistic theory, (1964), Mouton The Hague · Zbl 0183.00604
[3] Chomsky, Noam, On certain formal properties of grammar, Information and control, 2, 137-167, (1959) · Zbl 0088.10801
[4] Cobham, Alan, The intrinsic computational difficulty of functions, (), 24-30 · Zbl 0192.08702
[5] Grzegorczyk, Andrej, Some classes of recursive functions, (), Warsaw · Zbl 0224.02029
[6] Kleene, S.C., Introduction to metamathematics, (1952), Van Nostrand Princeton, N.J · Zbl 0047.00703
[7] Kuroda, S.Y., Classes of languages and linear-bounded automata, Information and control, 7, 207-223, (1964) · Zbl 0199.04002
[8] Peter, Rozsa, Rekursive funktionen, (1951), Akademia Kiado Budapest · Zbl 0043.24802
[9] Peters, Stanley, A note on the equivalence of ordered and unordered grammars, Harvard computation laboratory report to NSF, no. 17, (1966)
[10] Peters, Stanley; Ritchie, R.W., On restricting the base component of transformational grammars, Information and control, 18, 483-501, (1971) · Zbl 0221.68044
[11] Putnam, Hilary, Some issues in the theory of grammar, () · Zbl 1005.03054
[12] Ritchie, R.W., Classes of predictably computable functions, Trans. amer. math. soc., 106, 139-173, (1963) · Zbl 0107.01001
[13] Ross, John R., A proposed rule of tree pruning, Harvard computation laboratory report to NSF, no. 17, (1966)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.