A Bibliography on Fuzzy Automata, Grammars and Lanuages

This bibliography contains references to papers on fuzzy formal languages, the generation of fuzzy languages by means of fuzzy grammars, the recognition of fuzzy languages by fuzzy automata and machines, as well as some applications of fuzzy set theory to syntactic pattern recognition, linguistics and natural language processing

Weighted sticker system

A sticker system is a computational model which uses a sticker operation on DNA molecules. A sticker operation works on the complementary relation of double stranded DNA by using ligation and annealing operation to form a complete double stranded DNA sequence. In this paper, a new variant of sticker systems, called weighted sticker systems, is introduced. Some basic properties of language families that are generated by the weighted sticker systems are investigated.This paper also introduces some restricted weighted variants of sticker systems such as weighted one-sided, regular, simple, simple one-sided and simple regular sticker systems. Moreover, the paper shows that the presence of weights increases the generative powers of usual variants of sticker systems

Algebraic Aspects of Families of Fuzzy Languages

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.\ud 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