1. K. Apt, From Logic Programming to Prolog, Prentice Hall, 1997.
2. E. Ashcroft, Z. Manna, A. Pnueli, A Decidable properties of monadic functional schemes, J. ACM, vol 20 (1973), N 3, p.489–499.
3. J.M. Barzdin, The complexity of recognition the symmetry by Turing machines. In Problemy Kibernetiky, 15, 1965, p.245–248 (in Russian).
4. M. Bird, The equivalence problem for deterministic two-tape automata, J. Comput. Syst. Sci., 7, 1973, p.218–236.
5. Tech. Report;A.O. Buda,1978