Langages d’interpretation des schemas recursifs. (French) Zbl 0331.68007


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


[1] ASCHCROFT E. MANNA Z. et PNUELI A., Decidable Properties of Monadic Functional Schemas, in Theory of Machines and Computation, pp. 3-17, Kohavi et Paz ed. Academic Press (1971). Zbl0306.68048 · Zbl 0306.68048
[2] COUSINEAU F. G. et RIFFLET J.-M., Schémas de Programme : Problèmes d’équivalence et complexité, Thèse de Troisième Cycle, Université Paris 7 (février 1974).
[3] GARLAND S. J. et LUCKHAM D. C., Program Schemes, Recursive Schemes and Formal Languages, J. Comput. System Sci. 7 (1973), n^\circ 2, pp. 119-160. Zbl0277.68010 · Zbl 0277.68010 · doi:10.1016/S0022-0000(73)80040-6
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.