Approximation of fuzzy context-free grammars
From MaRDI portal
Publication:845326
DOI10.1016/j.ins.2009.06.028zbMath1183.68330OpenAlexW2086998672WikidataQ62038198 ScholiaQ62038198MaRDI QIDQ845326
Publication date: 28 January 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.06.028
Related Items (1)
Cites Work
- 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
- On the recognizability of fuzzy languages. I
- Is there a need for fuzzy logic?
- Approximation and universality of fuzzy Turing machines
- Fuzzy automata and languages
- Metamathematics of fuzzy logic
- Triangular norms
- A probabilistic model of computing with words
- Determinism and fuzzy automata
- Approximation and robustness of fuzzy finite automata
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Determinization of fuzzy automata with membership values in complete residuated lattices
- On the use of words and fuzzy sets
- Fuzzy regular languages over finite and infinite words
- The relationships among several types of fuzzy automata
- Algebraic properties of \(LA\)-languages
- Fuzzy context-free languages. I: Generalized fuzzy context-free grammars
- Fuzzy context-free languages. II: Recognition and parsing algorithms
- An approach to measure the robustness of fuzzy reasoning
- Deterministic Acceptors of Regular Fuzzy Languages
- Quantum Complexity Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation of fuzzy context-free grammars
