1. AUSIELLO G.(1975). Simple programs on strings and their decision problems. Istituto di Automatica, R.75–15, Roma.
2. CHERNIAVSKY J(1974). A notion of realizability for decidable logical theories. SUNY at Stony Brook, Dept. of C.S.
3. CHYTIL M.P.(1976). A note on simple programs and 2-way finite state transducers (in preparation).
4. CONSTABLE R.L., H.B. HUNT III, S. SAHNI (1974). On the computational complexity of scheme equivalencc. Dept. C.S.-TR 74–201, Cornell University.
5. COOK S.(1975). Feasibly constructive proofs and the propositional calculus. Proceedings of VII ACM Symposium on Theory of Computing, Albuqyerque, N.M.