This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
A. A. Letichevskii, “Equivalence of automata relative to semigroups,” in: Engineering Cybernetics [in Russian], No. 6, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1970).
A. A. Letichevskii and L. B. Smikun, “On one class of groups with a solvable problem of equivalence of automata,” Dokl. Akad. Nauk SSSR,227, No. 1 (1976).
M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Dev.,3, 114–125 (1959).
V. N. Red'ko, “Definitor algebras and algebras of languages,” Kibernetika, No. 4 (1973).
V. N. Red'ko, “Definitors and languages,” in: Languages and Processors [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1974).
V. N. Red'ko, “Parametric programming systems,” Author's Abstract of Doctoral Dissertation, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1969).
V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Aspects of Algebra and Logic [in Russian], Novosibirsk (1973).
L. B. Smikum, “On the connection of context-free groups and groups with a solvable problem of equivalence of automata,” Kibernetika, No. 5 (1976).
A. V. Anisimov and F. D. Zaifert, “Zur algebraischen Charakteristik der durch kontext-freie sprachen definierten Gruppen,” Elektron. Informationsverarb. Kybern.,11, Nos. 10–12 (1975).
Translated from Kibernetika, No. 4, pp. 120–125, July–August, 1978.
About this article
Cite this article
Smikun, L.B. Regular sets and finite automata overβ-groups. Cybern Syst Anal 14, 609–615 (1978). https://doi.org/10.1007/BF01069846
- Operating System
- Artificial Intelligence
- System Theory
- Finite Automaton