The utilization of fuzzy sets in the recognition of imperfect strings
Fuzzy Sets and Systems
Fuzzy grammars and recursively enumerable fuzzy languages
Information Sciences: an International Journal
The recognition of imperfect strings generated by fuzzy context sensitive grammars
Fuzzy Sets and Systems
Fuzzy sets, fuzzy logic, and fuzzy systems: selected papers by Lotfi A. Zadeh
Fuzzy sets, fuzzy logic, and fuzzy systems: selected papers by Lotfi A. Zadeh
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Algebraic aspects of families of fuzzy languages
Theoretical Computer Science - Algebraic methods in language processing
Controlled Fuzzy Parallel Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
A Generalisation of Parikh's Theorem in Formal Language Theory
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Fuzzy Sets and Systems
Fuzzy Sets and Systems
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Approximation of fuzzy context-free grammars
Information Sciences: an International Journal
Hi-index | 5.23 |
Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These fuzzy context-free K-grammars provide a general framework to describe correctly as well as erroneously derived sentences by a single generating mechanism. They model the situation of making a finite choice out of an infinity of possible grammatical errors during each context-free derivation step. Formally, a fuzzy context-free K-grammar is a fuzzy context-free grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol α, the set containing all right-hand sides of rules with left-hand side equal to α forms a fuzzy language that belongs to a given family K of fuzzy languages. We investigate the generating power of fuzzy context-free K-grammars, and we show that under minor assumptions on the parameter K, the family of languages generated by fuzzy context-free K-grammars possesses closure properties very similar to those of the family of ordinary context-free languages.