Допомога UA
English
Čeština
From automata to multiautomata via theory of hypercompositional structures
Abstract:
In this paper, we study two important problems related to quasi-multiautomata: the complicated nature of verification of the GMAC condition for systems of quasi-multiautomata, and the fact that the nature of quasi-multiautomata has deviated from the original nature of automata as seen by the theory of formal languages. For the former problem, we include several new conditions that simplify the procedure. For the latter problem, we close this gap by presenting a construction of quasimultiautomata, which corresponds to deterministic automata of the theory of formal languages and is based on the operation of concatenation.