×

Program schemes, recursion schemes, and formal languages. (English) Zbl 0277.68010


MSC:

68N01 General topics in the theory of software
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] deBakker, J. W.; Scott, Dana, A Theory of Programs (August 1969), unpublished report
[2] Hopcroft, J. E.; Ullman, J. D., (Formal Languages and their Relation to Automata (1969), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0196.01701
[3] Ianov, Iu. I., The logical schemes of algorithms, Problemy Kibernet., 1, 82-140 (1960)
[4] Luckham, D. C.; Park, D. M.R.; Paterson, M. S., On formalized computer programs, J. Comput. System Sci., 4, 220-249 (1970) · Zbl 0209.18704
[5] Nivat, M., Transductions des Languages de Chomsky, (doctoral dissertation (1967), Grenoble University), Chapter 6 · Zbl 0313.68065
[6] Paterson, M. S.; Hewitt, C. E., Comparative Schematology, (record of the Project MAC Conference on Concurrent Systems and Parallel Computation. record of the Project MAC Conference on Concurrent Systems and Parallel Computation, June 1970 (Dec. 1970), ACM), 119-128, published by the · Zbl 0401.68002
[7] Rabin, M.; Scott, D., Finite automata and their decision problems, IBM J. Res. Develop., 3, 114-125 (1959) · Zbl 0158.25404
[8] Shepherdson, J. C.; Sturgis, H. E., Computability of recursive functions, J. Assoc. Comput. Mach., 10, 217-255 (1963) · Zbl 0118.25401
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.