FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION

DOI10.1142/S0218488504002679zbMath1074.68032MaRDI QIDQ4812691

Ketty G. Peeva

Publication date: 23 August 2004

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

zbMATH Keywords

pattern recognitionfuzzy grammarfuzzy acceptor

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Grammars and rewriting systems (68Q42)

Related Items

Infinite fuzzy computations ⋮ \(L^B\)-valued general fuzzy automata ⋮ On the category of \(L\)-fuzzy automata, coalgebras and dialgebras ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Bisimulations for fuzzy automata ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ 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
• Fuzzy acceptors for syntactic pattern recognition
• Fuzzy grammars and recursively enumerable fuzzy languages
• L-fuzzy grammars
• Syntactic methods in pattern recognition
• Max-product grammars and languages
• Fuzzy automata and languages
• General fuzzy acceptors for syntactic pattern recognition
• L-fuzzy sets
• N-fold fuzzy grammars
• Context-free fuzzy languages