A Simplified Form of Fuzzy Multiset Finite Automata
| Autor: | Pavel Martinek |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Multiset TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Finite-state machine Computer science Fuzzy set 0102 computer and information sciences 02 engineering and technology Nonlinear Sciences::Cellular Automata and Lattice Gases 01 natural sciences Fuzzy logic Automaton TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Quantum finite automata Automata theory 020201 artificial intelligence & image processing Computer Science::Formal Languages and Automata Theory |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9783319336237 CSOC (1) |
| DOI: | 10.1007/978-3-319-33625-1_42 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|