TBU Publications
Repository of TBU Publications

A simplified form of fuzzy multiset finite automata

DSpace Repository

Title: A simplified form of fuzzy multiset finite automata
Author: Martinek, Pavel
Document type: Conference paper (English)
Source document: 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
Abstract: 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.
Full text: https://link.springer.com/chapter/10.1007/978-3-319-33625-1_42
Physical copies: Copies in TBU Library catalogue
Show full item record

Find Full text Export to RefWorks
   

 

Files in this item

Icon
Name: Fulltext_1006433.pdf
Size: 140.8Kb
Format: PDF
Description: fulltext

ČSN ISO 690:2011 citation

Citace článku v konferenčním sborníku:
MARTINEK, Pavel. A simplified form of fuzzy multiset finite automata. In: Advances in Intelligent Systems and Computing [online]. Prague: Springer Verlag, 2016, s. 469-476. [cit. 2024-04-26]. ISSN 2194-5357. Dostupné z: https://link.springer.com/chapter/10.1007/978-3-319-33625-1_42.

These citations are software generated and may contain errors. To verify accuracy, check the appropriate style guide.

Related articles