Fuzzy grammars and recursively enumerable fuzzy languages
From MaRDI portal
Publication:1186363
DOI10.1016/0020-0255(92)90008-VzbMath0753.68056MaRDI QIDQ1186363
Publication date: 28 June 1992
Published in: Information Sciences (Search for Journal in Brave)
Related Items
Interval type-2 fuzzy automata and interval type-2 fuzzy grammar, FINITE ${\mathbb L}$–FUZZY ACCEPTORS, REGULAR ${\mathbb L}$–FUZZY GRAMMARS AND SYNTACTIC PATTERN RECOGNITION, Fuzzy grammar theory based on lattices, An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids, Fuzzy subsets: A constructive approach, AN APPROACH TO MEMBRANE COMPUTING UNDER INEXACTITUDE, Homomorphisms of fuzzy recognizers, Fuzzy context-free languages. I: Generalized fuzzy context-free grammars, Fuzzy context-free languages. II: Recognition and parsing algorithms, Fuzzy Regular Languages Based on Residuated Lattice, Algebraic aspects of families of fuzzy languages
Cites Work
- Unnamed Item
- Unnamed Item
- Decidability, partial decidability and sharpness relation for L-subsets
- Fuzzy and probabilistic programs
- Turing L-machines and recursive computability for L-maps
- L-fuzzy sets
- FUZZY RECURSION, RET'S, AND ISOLS
- Recursively EnumerableL-Sets
- Sharpness relation and decidable fuzzy sets
- Fuzzy sets
- Fuzzy algorithms
