Fuzzy language on free monoid
From MaRDI portal
Publication:1364503
DOI10.1016/0020-0255(95)00129-8zbMath0882.68081MaRDI QIDQ1364503
Publication date: 4 September 1997
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(95)00129-8
free monoid; dense language; adjunctive language; finite \(F\)-automaton; fuzzy algebraic structures; fuzzy formal languages; fuzzy regular language
68Q45: Formal languages and automata
Related Items
An algorithm of test for fuzzy codes, A generalization of Myhill-Nerode theorem for fuzzy languages, 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, Algebraic properties on the cuts of lattice-valued regular languages, Myhill-Nerode type theory for fuzzy languages and automata, Automata theory based on complete residuated lattice-valued logic: Pushdown automata, A remark on Myhill-Nerode theorem for fuzzy languages, Equivalence in automata theory based on complete residuated lattice-valued logic, Minimization of lattice finite automata and its application to the decomposition of lattice languages, Determinization of fuzzy automata with membership values in complete residuated lattices, The relationships among several types of fuzzy automata, Algebraic properties of \(LA\)-languages, Homomorphisms of fuzzy recognizers
Cites Work
