On primitive recursive wordfunctions-Reference-Cited by-同舟云学术

On primitive recursive wordfunctions

Published:1975-09 Issue:3 Volume:15 Page:217-234
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

v. Henke F. W.,Rose G.,Indermark K.,Weihrauch K.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02242369.pdf

Reference22 articles.

1. Asser, G.: Rekursive Wortfunktionen. Zeitschr. math. Logik Grdl. Math.6, 258–278 (1960).

2. Axt, P.: Iteration of primitive recursion. Zeitschr. math. Logik Grdl. Math.11, 253–255 (1965).

3. Cobham, A.: The intrinsic computational difficulty of functions. In: Logic, Methodology, and Philosophy of Science (Bar-Hillel, Y., ed.), Amsterdam: North-Holland Publ. Comp. 1965.

4. Eilenberg, S., Elgot, C. C.: Recursiveness. New York-London: Academic Press. 1970.

5. Grzegorczyk, A.: Some classes of recursive functions. Rozprawy matem.4, 1–46 (1953).

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Power of Recursive Word-Functions Without Concatenation;Descriptional Complexity of Formal Systems;2022

2. Some Hierarchies of Primitive Recursive Functions on Term Algebras;Mathematical Logic Quarterly;1997

3. Modular tree transducers;Theoretical Computer Science;1991-01

4. A hierarchy of unary primitive recursive string-functions;Aspects and Prospects of Theoretical Computer Science;1990

5. Bibliography;Computability, Complexity, Logic;1989