Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
From MaRDI portal
Publication:2576872
DOI10.1016/j.tcs.2005.06.012zbMath1080.68047OpenAlexW2062342426MaRDI QIDQ2576872
Publication date: 29 December 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.012
Related Items (14)
Error tolerance for the recognition of faulty strings in a regulated grammar using fuzzy sets ⋮ Approximation of fuzzy context-free grammars ⋮ On the recognizability of fuzzy languages. I ⋮ On typical hesitant fuzzy automata ⋮ On closure properties of \(\mathcal{L}\)-valued linear languages ⋮ An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids ⋮ Quantum Reversible Fuzzy Grammars ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ Approximation and universality of fuzzy Turing machines ⋮ Fuzzy pushdown automata ⋮ Automata theory based on complete residuated lattice-valued logic: Pushdown automata ⋮ Fuzzy context-free languages. II: Recognition and parsing algorithms ⋮ Fuzzy state grammar and fuzzy deep pushdown automaton ⋮ Algebraic aspects of families of fuzzy languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy grammars and recursively enumerable fuzzy languages
- L-fuzzy grammars
- The utilization of fuzzy sets in the recognition of imperfect strings
- Algebraic aspects of families of fuzzy languages
- L-fuzzy sets
- Substitution in families of languages
- Optimization of LR(k) parsers
- Fuzzy context-free languages. II: Recognition and parsing algorithms
- Full AFLs and nested iterated substitution
This page was built for publication: Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
