Cartesian composition and the problem of generalizing the MAC condition to quasi-multiautomata
By:
Abstract
When we assume that the input-set of an automaton without output is a semihypergroup instead of a monoid, we talk about quasi-multiautomata. Even though cartesian composition of quasi-automata is a commonly used concept, the cartesian composition of quasi-multiautomata has not been successfully constructed yet. In our paper we show that the straightforward transfer of the deffinition into the multivariate context fails. We suggest two possible solutions of this problem.
Language: English
Page range: 79 - 100
Submitted on: Jul 10, 2015
Accepted on: Dec 15, 2015
Published on: Sep 21, 2017
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Keywords:
Related subjects:
© 2017 Jan Chvalina, Štěpán Kŕehlík, Michal Novák, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.