Fuzzy acceptors for syntactic pattern recognition
From MaRDI portal
Publication:809615
DOI10.1016/0888-613X(91)90014-DzbMath0733.68068MaRDI QIDQ809615
Publication date: 1991
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
syntactic pattern recognition\(\epsilon \) -equivalence\(\epsilon \) -reduction by inputsfuzzy acceptors
Related Items
Sequential pattern recognition employing recurrent fuzzy systems ⋮ FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION ⋮ General fuzzy acceptors for syntactic pattern recognition ⋮ Infinite fuzzy computations ⋮ New directions in LB-valued general fuzzy automata: A topological view ⋮ \(L^B\)-valued general fuzzy automata ⋮ Two dimensional fuzzy regular languages ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On a factorized \(L\)-fuzzy automaton and its \(L\)-fuzzy topological characterization ⋮ On a category of fuzzy automata with relations ⋮ On \(L^M\)-valued automata: an operator oriented view ⋮ Different Operators in Automata Theory Based on Residuated and Co-Residuated Lattices ⋮ Measure of Operators Associated with Fuzzy Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hierarchical pattern classification
- Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata
- Fuzzy partitions and relations; an axiomatic basis for clustering
- Fuzzy sets and systems. Theory and applications
- Syntactic methods in pattern recognition
- On reductions of maximin machines
This page was built for publication: Fuzzy acceptors for syntactic pattern recognition