Kontaktujte nás | Jazyk: čeština English
Název: | A simplified form of fuzzy multiset finite automata |
Autor: | Martinek, Pavel |
Typ dokumentu: | Článek ve sborníku (English) |
Zdrojový dok.: | Advances in Intelligent Systems and Computing. 2016, vol. 464, p. 469-476 |
ISSN: | 2194-5357 (Sherpa/RoMEO, JCR) |
ISBN: | 978-3-319-33623-7 |
DOI: | https://doi.org/10.1007/978-3-319-33625-1_42 |
Abstrakt: | Fuzzy multiset finite automata represent fuzzy version of finite automata working over multisets. Description of these automata can be simplified to such a form where transition relation is bivalent and only the final states form a fuzzy set. In this paper it is proved that the simplified form preserves computational power of the automata and way of how to perform the corresponding transformation is described. © Springer International Publishing Switzerland 2016. |
Plný text: | https://link.springer.com/chapter/10.1007/978-3-319-33625-1_42 |
Fyzické výtisky: | Jednotky v katalogu Knihovny UTB |
Zobrazit celý záznam |