Algebraic Aspects of Families of Fuzzy Languages

P.R.J. Asveld

    Research output: Book/ReportReportOther research output

    Abstract

    We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, 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 the notion of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages. Some simpler and more complicated algebraic structures (such as full substitution-closed AFFL, full super-AFFL, full hyper-AFFL) will be considered as well. 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 languageUndefined
    Place of PublicationEnschede
    PublisherCentre for Telematics and Information Technology (CTIT)
    Number of pages24
    Publication statusPublished - Feb 2001

    Publication series

    NameCTIT Technical Report Series
    No.01-05
    ISSN (Print)1381-3625

    Keywords

    • EWI-5930
    • IR-63118

    Cite this

    Asveld, P. R. J. (2001). Algebraic Aspects of Families of Fuzzy Languages. (CTIT Technical Report Series; No. 01-05). Enschede: Centre for Telematics and Information Technology (CTIT).
    Asveld, P.R.J. / Algebraic Aspects of Families of Fuzzy Languages. Enschede : Centre for Telematics and Information Technology (CTIT), 2001. 24 p. (CTIT Technical Report Series; 01-05).
    @book{94fe1c0188b74fb99eed6c0752a12ce2,
    title = "Algebraic Aspects of Families of Fuzzy Languages",
    abstract = "We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, 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 the notion of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages. Some simpler and more complicated algebraic structures (such as full substitution-closed AFFL, full super-AFFL, full hyper-AFFL) will be considered as well. 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.",
    keywords = "EWI-5930, IR-63118",
    author = "P.R.J. Asveld",
    note = "Imported from CTIT",
    year = "2001",
    month = "2",
    language = "Undefined",
    series = "CTIT Technical Report Series",
    publisher = "Centre for Telematics and Information Technology (CTIT)",
    number = "01-05",
    address = "Netherlands",

    }

    Asveld, PRJ 2001, Algebraic Aspects of Families of Fuzzy Languages. CTIT Technical Report Series, no. 01-05, Centre for Telematics and Information Technology (CTIT), Enschede.

    Algebraic Aspects of Families of Fuzzy Languages. / Asveld, P.R.J.

    Enschede : Centre for Telematics and Information Technology (CTIT), 2001. 24 p. (CTIT Technical Report Series; No. 01-05).

    Research output: Book/ReportReportOther research output

    TY - BOOK

    T1 - Algebraic Aspects of Families of Fuzzy Languages

    AU - Asveld, P.R.J.

    N1 - Imported from CTIT

    PY - 2001/2

    Y1 - 2001/2

    N2 - We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, 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 the notion of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages. Some simpler and more complicated algebraic structures (such as full substitution-closed AFFL, full super-AFFL, full hyper-AFFL) will be considered as well. 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.

    AB - We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, 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 the notion of full Abstract Family of Languages that has been encountered frequently in investigating families of crisp (i.e., non-fuzzy) languages. Some simpler and more complicated algebraic structures (such as full substitution-closed AFFL, full super-AFFL, full hyper-AFFL) will be considered as well. 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.

    KW - EWI-5930

    KW - IR-63118

    M3 - Report

    T3 - CTIT Technical Report Series

    BT - Algebraic Aspects of Families of Fuzzy Languages

    PB - Centre for Telematics and Information Technology (CTIT)

    CY - Enschede

    ER -

    Asveld PRJ. Algebraic Aspects of Families of Fuzzy Languages. Enschede: Centre for Telematics and Information Technology (CTIT), 2001. 24 p. (CTIT Technical Report Series; 01-05).