A Simplified Form of Fuzzy Multiset Finite Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F16%3A43874425" target="_blank" >RIV/70883521:28140/16:43874425 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-319-33625-1_42" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-319-33625-1_42</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-33625-1_42" target="_blank" >10.1007/978-3-319-33625-1_42</a>
Alternative languages
Result language
angličtina
Original language name
A Simplified Form of Fuzzy Multiset Finite Automata
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Artificial Intelligence Perspectives in Intelligent Systems: Proceedings of the 5th computer science on-line conference 2016, vol. 1
ISBN
978-3-319-33623-7
ISSN
2194-5357
e-ISSN
—
Number of pages
8
Pages from-to
469-476
Publisher name
Springer-Verlag Berlin
Place of publication
Heidelberg
Event location
on-line
Event date
Apr 27, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000385237600042