Homomorphisms of fuzzy recognizers
From MaRDI portal
Publication:3579690
DOI10.1108/03684920710749839zbMath1193.93011OpenAlexW2045831642MaRDI QIDQ3579690
Publication date: 10 August 2010
Published in: Kybernetes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1108/03684920710749839
Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Pattern recognition, speech recognition (68T10) General systems (93A10) Grammars and rewriting systems (68Q42)
Related Items
Cites Work
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Fuzzy grammars and recursively enumerable fuzzy languages
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- Max-product grammars and languages
- On covering of products of fuzzy finite state machines
- Fuzzy language on free monoid
- Finite \(L\)-fuzzy machines.
- Fuzzy recognizers and recognizable sets
- Closure of finite-state automaton languages
- Maximin, Minimax, and composite sequential machines
- Max-product machines
- On reductions of maximin machines
- A formal power series approach to the construction of minimal fuzzy automata
- Fuzzy-state automata: Their stability and fault tolerance
- Modification tolerance of fuzzy-state automata
- On fuzzy recognizers
- General formulation of sequential machines
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Probabilistic grammars and automata
