Minimization of states in automata theory based on finite lattice-ordered monoids

Authors:
Hongxuan Lei;Yongming Li
Affiliations:
College of Mathematics and Information Science, Shaanxi Normal University, Chang'an Street, Xi'an 710062, China and Department of Mathematics, Neijiang Teachers College, Sichuan, Neijiang 641112, ...;College of Mathematics and Information Science, Shaanxi Normal University, Chang'an Street, Xi'an 710062, China and College of Computer Science, Shaanxi Normal University, Xi'an 710062, China
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 11
Cited 17

Behaviour, reduction and minimization of finite :G6-automata

Fuzzy Sets and Systems
A formal power series approach to the construction of minimal fuzzy automata

Information Sciences: an International Journal
Equivalence, reduction and minimization of finite automata over semirings

Theoretical Computer Science
Minimization of fuzzy finite automata

Information Sciences: an International Journal
On quotient machines of a fuzzy automaton and the minimal machine

Fuzzy Sets and Systems
On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification

On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification
The equivalence between fuzzy Mealy and fuzzy Moore machines

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids

Fuzzy Sets and Systems
The relationships among several types of fuzzy automata

Information Sciences: an International Journal
Supervisory control of fuzzy discrete event systems: a formal approach

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks

IEEE Transactions on Fuzzy Systems

Determinization of fuzzy automata with membership values in complete residuated lattices

Information Sciences: an International Journal
Diagnosability of fuzzy discrete event systems

Information Sciences: an International Journal
Computing behavior of finite fuzzy machines - Algorithm and its application to reduction and minimization

Information Sciences: an International Journal
Grammar theory based on lattice-ordered monoid

Fuzzy Sets and Systems
Estimation of transitional probabilities of discrete event systems from cross-sectional survey and its application in tobacco control

Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata

Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Reduction and minimization

Fuzzy Sets and Systems
Fuzzy relation equations and reduction of fuzzy automata

Journal of Computer and System Sciences
On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations

Fuzzy Sets and Systems
Bisimulations for fuzzy automata

Fuzzy Sets and Systems
From classic observability to a simple fuzzy observability for fuzzy discrete-event systems

Information Sciences: an International Journal
Construction of fuzzy automata from fuzzy regular expressions

Fuzzy Sets and Systems
Characterizations of complete residuated lattice-valued finite tree automata

Fuzzy Sets and Systems
Factorization of fuzzy automata

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Fuzzy relation equations and subsystems of fuzzy transition systems

Knowledge-Based Systems
Algebraic properties of L-fuzzy finite automata

Information Sciences: an International Journal
Fuzzy identities with application to fuzzy semigroups

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this study, we consider a concept of complete L-fuzzy matrix, define complete lattice-valued finite automata (CLFAs) and study their properties. The definitions of statewise equivalence relations and automata equivalence relations of a CLFA are given, two algorithms are aimed at the minimization of states of a CLFA.