@book{6bc1075f4cb14b4882ac956c09827d8e,

title = "Fuzzy Context-Free Languages. Part 1: Generalized Fuzzy Context-Free Grammars",

abstract = "Motivated by aspects of robustness in parsing a context-free language, we study generalized fuzzy context-free grammars. These so-called fuzzy context-free $K$-grammars provide a very 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 $\alpha$, the set containing all right-hand sides of rules with left-hand side equal to $\alpha$ 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.",

keywords = "EWI-5956, METIS-118712, IR-63133",

author = "P.R.J. Asveld",

note = "Imported from CTIT",

year = "2000",

month = mar,

language = "Undefined",

series = "CTIT Technical Report Series",

publisher = "Centre for Telematics and Information Technology (CTIT)",

number = "00-03",

address = "Netherlands",

}