This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. R. O. Buhey, “Decision procedure for a second-order bounded arithmetic,” Kibern. Sb., No. 8, 78–90 (1964).
M. O. Rabin, “Decidability of second-order theories and machines over infinite trees,” Kibern. Sb., No. 8, 72–116 (1971).
J. V. Thatcher and J. B. Wright, “A generalized finite state machine theory and its applications to decision problems in second-order logic,” Kibern. Sb., No. 6, 112–144 (1969).
A. A. Letichevskii, “Equivalence of automata relative to semigroups,” Teor. Kibern. No. 6, 7–12 (1970).
L. P. Lisovik, “Equivalence problem for converters over marked trees,” Dokl. Akad. Nauk UkrSSR, No. 6, 77–79 (1980).
J. E. Donner, “Decidability of the weak second-order theory of one function,” Not. Am. Math. Soc.,12, 819 (1965).
V. N. Red'ko and L. P. Lisovik, “Equivalence problem for reversal-bounded counter machines,” Kibern., No. 4, 26–28 (1980).
O. H. Ibarra, “Reversal-bounded multicounter machines and their decision problems,” Commun. ACM,25, No. 1, 116–133 (1978).
L. P. Lisovik, “Rigid sets and finite coverings of semigroups” Kibern., No. 1, 12–16 (1980).
L. P. Lisovik, “Construction of decidable singular theories for sequential functions with an additional predicate,” Algebra Logika,23, No. 3, 266–277 (1984).
Additional information
Translated from Kibernetika, No. 3, pp. 19–22, May–June, 1988.
Rights and permissions
About this article
Cite this article
Lisovik, L.P. Reversal-bounded multicounter Σ-machines. Cybern Syst Anal 24, 293–298 (1988). https://doi.org/10.1007/BF01132080
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01132080