Homomorphisms of fuzzy recognizers
From MaRDI portal
Publication:3579690
Recommendations
Cites work
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- A formal power series approach to the construction of minimal fuzzy automata
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Closure of finite-state automaton languages
- Finite \(L\)-fuzzy machines.
- Fuzzy grammars and recursively enumerable fuzzy languages
- Fuzzy language on free monoid
- Fuzzy recognizers and recognizable sets
- Fuzzy-state automata: Their stability and fault tolerance
- General formulation of sequential machines
- Max-product grammars and languages
- Max-product machines
- Maximin automata
- Maximin, Minimax, and composite sequential machines
- Modification tolerance of fuzzy-state automata
- On covering of products of fuzzy finite state machines
- On fuzzy recognizers
- On reductions of maximin machines
- Probabilistic grammars and automata
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
Cited in
(3)
This page was built for publication: Homomorphisms of fuzzy recognizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579690)