Detail výsledku

n-ary Cartesian composition of automata

NOVÁK, M.; KŘEHLÍK, Š.; STANĚK, D. n-ary Cartesian composition of automata. SOFT COMPUTING, 2020, vol. 24, no. 3, p. 1837-1849. ISSN: 1432-7643.
Typ
článek v časopise
Jazyk
angličtina
Autoři
Novák Michal, doc. RNDr., Ph.D., UMAT (FEKT)
Křehlík Štěpán, RNDr., Ph.D.
Staněk David, Mgr., UMAT (FEKT)
Abstrakt

In our paper, we construct Cartesian composition of automata in a way rather different from the classical approach. In our case, the resulting structure is not an automaton but a quasi-multiautomaton, i.e., a structure whose input alphabet is a semi-hypergroup instead of a set or a free monoid. In our reasoning, we make use of earlier results on complete (semi)hypergroups and show that this approach not only simplifies our construction but also yields some natural applications.

Klíčová slova

Cartesian composition of automata; Complete hypergroup; EL-semihypergroup; Hypergroup; Theory of automata

URL
Rok
2020
Strany
1837–1849
Časopis
SOFT COMPUTING, roč. 24, č. 3, ISSN 1432-7643
Vydavatel
SPRINGER
Místo
NEW YORK
DOI
10.1007/s00500-019-04015-1
UT WoS
000518595800018
EID Scopus
2-s2.0-85065204676
BibTeX 
@article{BUT162757,
  author="Michal {Novák} and Štěpán {Křehlík} and David {Staněk}",
  title="n-ary Cartesian composition of automata",
  journal="SOFT COMPUTING",
  year="2020",
  volume="24",
  number="3",
  pages="1837--1849",
  doi="10.1007/s00500-019-04015-1",
  issn="1432-7643",
  url="https://link.springer.com/article/10.1007/s00500-019-04015-1"
}
Pracoviště
Ústav matematiky (UMAT)
Nahoru