Fuzzy recognizers and recognizable sets

DOI10.1016/S0165-0114(01)00160-9zbMath1010.68077MaRDI QIDQ1867647

H. V. Kumbhojkar, S. R. Chaudhari

Publication date: 2 April 2003

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

zbMATH Keywords

completionhomomorphismfuzzy finite state machinefuzzy recognizer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Minimization of lattice finite automata and its application to the decomposition of lattice languages ⋮ Two dimensional fuzzy regular languages ⋮ The lattice-valued Turing machines and the lattice-valued type 0 grammars ⋮ Algebraic properties on the cuts of lattice-valued regular languages ⋮ Results on the use of category theory for the study of lattice-valued finite state machines ⋮ Homomorphisms of fuzzy recognizers ⋮ The relationships among several types of fuzzy automata ⋮ Algebraic properties of \(LA\)-languages ⋮ Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy sets and systems. Theory and applications
• Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
• On covering of products of fuzzy finite state machines
• On subsystems of a fuzzy finite state machine
• Some considerations on Fuzzy automata
• Max-product machines
• Examples of formal grammars with weights
• FUZZY‐FUZZY 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