This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. N. Red'ko, “Definite algebras and language algebras,” Kibernetika, No. 4 (1973).
V. N. Red'ko and L. P. Lisovik, “Identity problem for quasiregular algebras over a commutative semigroup and commutative semigroup languages,” Kibernetika, No. 5 (1975).
A. V. Anisimov and L. P. Lisovik, “Equivalence problem of finite-automata mappings in free and commutative semigroups,” Kibernetika, No. 3 (1978).
V. A. Tuzov, “Equivalence of logic schemes with commutative operators,” Kibernetika, No. 6 (1970).
V. A. Tuzov, “Resolution problems for graph-schemes with commutative operators. I, II,” Kibernetika, Nos. 4 and 5 (1971).
M. O. Rabin and D. Scott, “Finite automata and their resolution problems” Cybernetics Collection [Russian translation], No. 4, Moscow (1962).
T. Bird, “The equivalence problem for deterministic two-tape automata,” J. Comput. Syst. Sci.,7, No. 2 (1973).
V. M. Glushkov and A. A. Letichevskii, “Theory of discrete converters,” in: Selected Questions of Algebra and Logic [in Russian], Novosibirsk (1973).
M. A. Taitslin, “On elementary theories of commutative semigroups,” Algebra i Logika,5, No. 4 (1966).
A. P. Ershov, “State of the art of the theory of program schemes,” in: Problems of Cybernetics [in Russian], No. 27, Moscow (1973).
Additional information
Translated from Kibernetika, No. 4, pp. 37–42, July–August, 1978.
Rights and permissions
About this article
Cite this article
Zubenko, V.V. Finite-automata mappings in a partially commutative semigroup. Cybern Syst Anal 14, 521–526 (1978). https://doi.org/10.1007/BF01069831
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069831