Algebraic aspects of families of fuzzy languages

DOI10.1016/S0304-3975(01)00354-1zbMath1026.68078MaRDI QIDQ1870578

Peter R. J. Asveld

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fuzzy languagesclosure propertiesinfinite hierarchycontrolled iterated fuzzy substitutionfull abstract family of fuzzy languagesfull AFFL

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (21)

Minimization of lattice finite automata and its application to the decomposition of lattice languages ⋮ On the recognizability of fuzzy languages. I ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ On closure properties of \(\mathcal{L}\)-valued linear languages ⋮ 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 ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ A categorical approach to lattice-valued fuzzy automata ⋮ Cut sets as recognizable tree languages ⋮ Formal power series and regular operations on fuzzy languages ⋮ Nondeterministic fuzzy automata ⋮ The relationships among several types of fuzzy automata ⋮ Algebraic properties of \(LA\)-languages ⋮ Principal abstract families of weighted tree languages ⋮ Automata theory based on complete residuated lattice-valued logic: Pushdown automata ⋮ Fuzzy context-free languages. I: Generalized fuzzy context-free grammars ⋮ Fuzzy context-free languages. II: Recognition and parsing algorithms ⋮ 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

Cites Work

• Hierarchies of hyper-AFLs
• Fuzzy grammars and recursively enumerable fuzzy languages
• L-fuzzy grammars
• Fuzzy automata and languages
• On fuzzy regular languages
• L-fuzzy sets
• Substitution in families of languages
• Examples of formal grammars with weights
• Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
• Fuzzy context-free languages. II: Recognition and parsing algorithms
• Controlled iteration grammars and full hyper-AFL's
• Three hierarchies of transducers
• Full AFLs and nested iterated substitution
• Studies in abstract families of languages
• Ambiguity in Graphs and Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic aspects of families of fuzzy languages