Algebraic Aspects of Families of Fuzzy Languages

Peter R.J. Asveld

Research output: Contribution to journalConference articleAcademicpeer-review

22 Citations (Scopus)
25 Downloads (Pure)

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 languageEnglish
Pages (from-to)417-445
Number of pages29
JournalTheoretical computer science
Volume293
Issue number2
DOIs
Publication statusPublished - 2003
Event2nd International AMAST Workshop on Algebraic Methods in Language Processing, AMiLP 2000 - Iowa City, United States
Duration: 20 May 200022 May 2000
Conference number: 2

Keywords

  • Fuzzy languages
  • Closure properties
  • Full abstract family of fuzzy languages (full AFFL)
  • Controlled iterated fuzzy substitution
  • Infinite hierarchy

Fingerprint Dive into the research topics of 'Algebraic Aspects of Families of Fuzzy Languages'. Together they form a unique fingerprint.

  • Cite this