Information Sciences: an International Journal
Information Sciences: an International Journal
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Fuzzy Switching and Automata: Theory and Applications
Fuzzy Switching and Automata: Theory and Applications
Fuzzy Relational Systems: Foundations and Principles
Fuzzy Relational Systems: Foundations and Principles
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Fuzzy recognizers and recognizable sets
Fuzzy Sets and Systems - Mathematics
Determinism and fuzzy automata
Information Sciences—Informatics and Computer Science: An International Journal
Regular grammars with truth values in lattice-ordered monoid and their languages
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Information Sciences: an International Journal
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
The relationship of controllability between classical and fuzzy discrete-event systems
Information Sciences: an International Journal
Grammar theory based on lattice-ordered monoid
Fuzzy Sets and 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
Finite automata theory with membership values in lattices
Information Sciences: an International Journal
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
Construction of fuzzy automata from fuzzy regular expressions
Fuzzy Sets and Systems
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
Algebraic properties of L-fuzzy finite automata
Information Sciences: an International Journal
| Hi-index | 0.07 |
In this study, we introduce the concepts of L-valued regular substitution (LA-substitution), deterministic L-valued regular substitution (DLA-substitution), L-valued fuzzy homomorphism and its inverse images, homomorphism and its inverse images for a lattice-ordered monoid L. We also study the properties of LA-languages and DLA-languages under the above-mentioned algebraic operations. The algebraic characterization of the L-valued regular language is given.