Skip to main content
Conference Proceedings

A simplified form of fuzzy multiset finite automata

Advances in Intelligent Systems and Computing (2016) 464 469-476
DOI: 10.1007/978-3-319-33625-1_42
4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Martinek, P. (2016). A simplified form of fuzzy multiset finite automata. In Advances in Intelligent Systems and Computing (Vol. 464, pp. 469–476). Springer Verlag. https://doi.org/10.1007/978-3-319-33625-1_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free