<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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. </p></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.

Cartesian composition and the problem of generalizing the MAC condition to quasi-multiautomata

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

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 and the problem of generalizing the MAC condition to quasi-multiautomata

Online veröffentlicht: 21. Sept. 2017

Seitenbereich: 79 - 100

Eingereicht: 10. Juli 2015

Akzeptiert: 15. Dez. 2015

DOI: https://doi.org/10.1515/auom-2016-0049

Schlüsselwörter
Cartesian composition of quasi-automata, Generalization of quasi-automata, Hyperstructure theory and automata, Quasi-multiautomata.

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Cartesian composition and the problem of generalizing the MAC condition to quasi-multiautomata

Online veröffentlicht: 21. Sept. 2017

Seitenbereich: 79 - 100

Eingereicht: 10. Juli 2015

Akzeptiert: 15. Dez. 2015

DOI: https://doi.org/10.1515/auom-2016-0049

SchlüsselwörterCartesian composition of quasi-automata, Generalization of quasi-automata, Hyperstructure theory and automata, Quasi-multiautomata.

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
Cartesian composition of quasi-automata, Generalization of quasi-automata, Hyperstructure theory and automata, Quasi-multiautomata.