Automata over finite T-quasigroups / Skobelev, / Skobelev. (2018)

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (3))

Skobelev V.V., Skobelev V.G.
Automata over finite T-quasigroups

This paper investigates families of automata without outputs and also families of reversible Mealy and Moore automata specified by recurrence relations over finite T-quasigroups. Based on the decomposition of an Abelian group into the direct sum of primary cyclic groups, a unified approach is proposed to the hardware and software synthesis of such automata. Estimates are found for the time and space complexities of computations executed by these automata during one clock cycle. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: automaton without outputs, finite T-quasigroup, Mealy automaton, Moore automaton, Group theory, Abelian group, automaton without outputs, Hardware and software, Mealy automatons, Quasigroup, Recurrence relations, Time and space complexity, Unified approach, Automata theory

Skobelev V.V., Skobelev V.G. (2018). Automata over finite T-quasigroups. Cybernetics and Systems Analysis, 54 (3), 3-16. doi: [In Russian].


Institute of Information Technologies of VNLU

+38 (044) 525-36-24
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209