A formal power series approach to the construction of minimal fuzzy automata

DOI10.1016/0020-0255(91)90013-KzbMath0717.68059OpenAlexW2023010001MaRDI QIDQ2638786

Yanyan Li

Publication date: 1991

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(91)90013-k

zbMATH Keywords

pattern recognitionminimal fuzzy automatapower-series representationregular fuzzy grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Fuzzy logic; logic of vagueness (03B52) Cellular automata (computational aspects) (68Q80) Grammars and rewriting systems (68Q42)

Related Items (9)

Infinite fuzzy computations ⋮ Minimization of states in automata theory based on finite lattice-ordered monoids ⋮ Unnamed Item ⋮ Computing behavior of finite fuzzy machines -- algorithm and its application to reduction and minimization ⋮ Homomorphisms of fuzzy recognizers ⋮ Fuzzy regular languages over finite and infinite words ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ Bisimulation of type 2 for BL-general fuzzy automata ⋮ MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
• Max-product grammars and languages
• Some considerations on Fuzzy automata
• On the definition of a family of automata
• Sur divers produits de séries formelles
• Grammatical Inference: Introduction and Survey - Part II
• Deterministic Acceptors of Regular Fuzzy Languages
• Fuzzy sets
• Maximin automata
• On the Synthesis of Finite-State Machines from Samples of Their Behavior

This page was built for publication: A formal power series approach to the construction of minimal fuzzy automata