Algebraic properties of \(LA\)-languages

DOI10.1016/j.ins.2005.10.003zbMath1110.68078DBLPjournals/isci/LiL06OpenAlexW2015539567WikidataQ62038244 ScholiaQ62038244MaRDI QIDQ2509236

Yong-Ming Li, Ping Li

Publication date: 19 October 2006

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

Full work available at URL: https://doi.org/10.1016/j.ins.2005.10.003

zbMATH Keywords

lattice-ordered monoid\(L\)-valued finite automaton\(L\)-valued fuzzy homomorphism\(L\)-valued regular language\(L\)-valued regular substitution

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (18)

Approximation of fuzzy context-free grammars ⋮ \(L^B\)-valued general fuzzy automata ⋮ Bisimulations for fuzzy automata ⋮ Finite automata theory with membership values in lattices ⋮ Algebraic properties of \(L\)-fuzzy finite automata ⋮ Algebraic properties on the cuts of lattice-valued regular languages ⋮ An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ ON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES ⋮ Nondeterministic fuzzy automata with membership values in complete residuated lattices ⋮ The relationship of controllability between classical and fuzzy discrete-event systems ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ Formal power series and regular operations on fuzzy languages ⋮ Approximation and robustness of fuzzy finite automata ⋮ The relationships among several forms of weighted finite automata over strong bimonoids ⋮ Grammar theory based on lattice-ordered monoid ⋮ Algebraic properties of intuitionistic \(L\)-fuzzy multiset finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids
• Regular grammars with truth values in lattice-ordered monoid and their languages
• Fuzzy automata and languages
• Fuzzy language on free monoid
• On fuzzy regular languages
• Determinism and fuzzy automata
• Projective and injective objects in the category of quantales
• Fuzzy recognizers and recognizable sets
• Algebraic aspects of families of fuzzy languages
• Deterministic Acceptors of Regular Fuzzy Languages
• Maximin automata
• Fuzzy discrete structures

This page was built for publication: Algebraic properties of \(LA\)-languages