On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification
A probabilistic model of computing with words
Journal of Computer and System Sciences
Regular grammars with truth values in lattice-ordered monoid and their languages
Soft Computing - A Fusion of Foundations, Methodologies and Applications
The equivalence between fuzzy Mealy and fuzzy Moore machines
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Minimization of states in automata theory based on finite lattice-ordered monoids
Information Sciences: an International Journal
Equivalence in automata theory based on complete residuated lattice-valued logic
Fuzzy Sets and Systems
Determinization of fuzzy automata with membership values in complete residuated lattices
Information Sciences: an International Journal
Approximation and robustness of fuzzy finite automata
International Journal of Approximate Reasoning
A categorical approach to lattice-valued fuzzy automata
Fuzzy Sets and Systems
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Modeling and control of fuzzy discrete event systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Supervisory control of fuzzy discrete event systems: a formal approach
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A formal model of computing with words
IEEE Transactions on Fuzzy Systems
Computing with words via Turing machines: a formal approach
IEEE Transactions on Fuzzy Systems
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
| Hi-index | 0.20 |
Motivated by Li and Pedrycz's work on fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids and inspired by the close relationship between the automata theory and the theory of formal grammars, we have established a fundamental framework of L-valued grammar. It is shown that the set of L-valued regular languages coincides with the set of L-languages recognized by nondeterministic L-fuzzy finite automata and every L-language recognized by a deterministic L-fuzzy finite automaton is an L-valued regular language.