Publication detail

n-ary Cartesian composition of automata

NOVÁK, M. KŘEHLÍK, Š. STANĚK, D.

Original Title

n-ary Cartesian composition of automata

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

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

Authors

NOVÁK, M.; KŘEHLÍK, Š.; STANĚK, D.

Released

24. 1. 2020

Publisher

SPRINGER

Location

NEW YORK

ISBN

1432-7643

Periodical

SOFT COMPUTING

Year of study

24

Number

3

State

United States of America

Pages from

1837

Pages to

1849

Pages count

13

URL

https://link.springer.com/article/10.1007/s00500-019-04015-1

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"
}