Regular grammars with truth values in lattice-ordered monoid and their languages
From MaRDI portal
Publication:816869
DOI10.1007/s00500-004-0427-yzbMath1084.68066OpenAlexW2023739215WikidataQ62038248 ScholiaQ62038248MaRDI QIDQ816869
Publication date: 2 March 2006
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-004-0427-y
Related Items
Interval type-2 fuzzy automata and interval type-2 fuzzy grammar ⋮ Approximation of fuzzy context-free grammars ⋮ Fuzzy grammar theory based on lattices ⋮ Automata theory based on lattice-ordered semirings ⋮ Determinization of fuzzy automata with membership values in complete residuated lattices ⋮ Construction of fuzzy automata from fuzzy regular expressions ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ IF-topologies and IF-automata ⋮ Fuzzy regular languages over finite and infinite words ⋮ Formal power series and regular operations on fuzzy languages ⋮ Algebraic properties of \(LA\)-languages ⋮ Grammar theory based on lattice-ordered monoid
Cites Work
- Automata theory based on complete residuated lattice-valued logic
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- Fuzzy automata and languages
- Fuzzy language on free monoid
- Semigroup homomorphisms and fuzzy automata
- Remarks on uninorm aggregation operators
- Determinism and fuzzy automata
- On the torsion points of Drinfeld modules in abelian extensions
- Algebraic aspects of families of fuzzy languages
- Aggregation operators and fuzzy systems modeling
- Deterministic Acceptors of Regular Fuzzy Languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Regular grammars with truth values in lattice-ordered monoid and their languages
