This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. M. Glushkov, “An abstract automata theory,” Usp. Mat. Nauk, No. 5, 3–61 (1961).
S. Ginsburg, The Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).
L. P. Lisovik, “The identity problem for the algebra of regular events on semigroups,” Kibernetika, No. 2, 15–16 (1977).
V. N. Red'ko and L. P. Lisovik, “Regular events in semigroups,” Probl. Kibern., No. 37, 155–184 (1980).
L. P. Lisovik, “The identity problem for regular events on a direct product of a free and a cyclic semigroup,” Dokl. Akad. Nauk Ukr. SSR, No. 6, 410–413 (1979).
J. Shoenfield, Mathematical Logic, Addison-Wesley, Reading, Mass. (1967).
E. Post, “A variant of a recursively unsolvable problem,” Bull. Am. Math. Soc.,52, No. 4, 264–268 (1946).
C. C. Elgot and M. O. Rabin, “Decidability and undecidability of extensions of second (first) order theory of (generalized) successor,” J. Symbolic Logic,31, No. 2, 169–181 (1966).
Additional information
Translated from Kibernetika, No. 2, pp. 11–14, March–April, 1983.
Rights and permissions
About this article
Cite this article
Lisovik, L.P. Minimal undecidable identity problem for finite-automaton mappings. Cybern Syst Anal 19, 160–165 (1983). https://doi.org/10.1007/BF01072014
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072014