This is a preview of subscription content, log in via an institution to check access.
Literature Cited
L. P. Lisovik, “The equivalence problem for transformers on labeled trees,” Dokl. Akad. Nauk UkrSSR, No. 6, 76–78 (1980).
S. Ginsburg, Mathematical Theory of Context-Free Languages, McGraw-Hill (1966).
A. A. Letichevskii, “The equivalence of automata with respect to semigroups,” Teor. Kibern., No. 6, 3–71 (1970).
V. N. Red'ko and L. P. Lisovik, “The equivalence problem for finite-turn counter machines,” Kibernetika, No. 4, 26–28 (1980).
O. H. Ibarra, “Reversal-bounded multicounter machines and their decision problems,” J. ACM,25, No. 1, 116–133 (1978).
S. A. Greibach, “An infinite hierarchy of context-free languages,” J. ACM,16, No. 1, 91–106 (1969).
V. N. Red'ko and L. P. Lisovik, “The identity problem for, quasiregular algebras on a commutative semigroup and commutative semigroup languages,” Kibernetika, No. 5, 94–97 (1975).
V. M. Glushkov, “Theory of automata and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).
S. Garland and D. Luckham, “Standard schemata, recursive schemata, and formal languages” [Russian translation], Kibern. Sb., No. 13, 79–119 (1976).
A. L. Semenov, “Some algorithmic problems for systems of algorithmic algebras,” Dokl. Akad. Nauk SSSR,239, No. 5, 1063–1066 (1978).
L. P. Lisovik, “Construction of transformer algebras with decidable identity problem,” Dokl. Akad. Nauk UkrSSR, No. 2, 78–81 (1984).
Additional information
Translated from Kibernetika, No. 5, pp. 19–24, September–October, 1984.
Rights and permissions
About this article
Cite this article
Lisovik, L.P. Equivalence problem for transformers on Σ-trees with finite-turn counters. Cybern Syst Anal 20, 633–640 (1984). https://doi.org/10.1007/BF01071607
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071607