Algebraic aspects of families of fuzzy languages

Peter R.J. Asveld

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    40 Downloads (Pure)


    We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with regular fuzzy languages, and several kinds of (iterated) fuzzy substitution. Then we consider families of fuzzy languages, closed under a fixed collection of these operations, which results in the concept of full Abstract Family of Fuzzy Languages or full AFFL. This algebraic structure is the fuzzy counterpart of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages. In the second part of the paper we focus our attention to full AFFL’s closed under iterated parallel fuzzy substitution, where the iterating process is prescribed by given crisp control languages. Proceeding inductively over the family of these control languages, yields an infinite sequence of full AFFL-structures with increasingly stronger closure properties.
    Original languageEnglish
    Title of host publicationProceedings Algebraic Methods in Language Processing (AMILP 2000/TWLT16)
    Subtitle of host publicationAMAST workshop
    Place of PublicationIowa City, USA
    Publication statusPublished - 8 Feb 2000


    Dive into the research topics of 'Algebraic aspects of families of fuzzy languages'. Together they form a unique fingerprint.

    Cite this