Equivalence, reduction and minimization of finite fuzzy-automata

DOI10.1016/0022-247X(81)90165-7zbMath0477.68051MaRDI QIDQ1160487

Ketty G. Peeva, Vladimir V. Topentcharov

Publication date: 1981

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (15)

Equivalence in automata theory based on complete residuated lattice-valued logic ⋮ Minimization of lattice finite automata and its application to the decomposition of lattice languages ⋮ Infinite fuzzy computations ⋮ The equivalence between fuzzy Mealy and fuzzy Moore machines ⋮ Minimization of states in automata theory based on finite lattice-ordered monoids ⋮ Behaviour, reduction and minimization of finite \({\mathbb{L}}\)-automata ⋮ Unnamed Item ⋮ Finite \(L\)-fuzzy machines. ⋮ Equivalence, reduction and minimization of finite automata over semirings ⋮ Unnamed Item ⋮ Automata theory based on complete residuated lattice-valued logic: Reduction and minimization ⋮ Bisimulation of type 2 for BL-general fuzzy automata ⋮ ADMISSIBLE PARTITION FOR BL-GENERAL FUZZY AUTOMATON ⋮ MINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA ⋮ Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Cites Work

• The concept of a linguistic variable and its application to approximate reasoning. III
• Reduced forms for stochastic sequential machines
• Max-product machines
• On reductions of maximin machines
• Comments on the Minimization of Stochastic Machines
• General formulation of sequential machines
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence, reduction and minimization of finite fuzzy-automata