Journal of Computer and System Sciences
Formal languages
Fuzzy grammars and recursively enumerable fuzzy languages
Information Sciences: an International Journal
Information Sciences: an International Journal
Languages and machines: an introduction to the theory of computer science
Languages and machines: an introduction to the theory of computer science
An infinite sequence of full AFL-structures, each of which possesses an infinite hierarchy
Where mathematics, computer science, linguistics and biology meet
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Controlled Fuzzy Parallel Rewriting
New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Fuzzy context-free languages: part 1: Generalized fuzzy context-free grammars
Theoretical Computer Science
Fuzzy context-free languages: part 2: Recognition and parsing algorithms
Theoretical Computer Science
Different Types of Linear Fuzzy Cellular Automata and their Applications
Fundamenta Informaticae - Membrane Computing
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Fuzzy Sets and Systems
Cut sets as recognizable tree languages
Fuzzy Sets and Systems
A categorical approach to lattice-valued fuzzy automata
Fuzzy Sets and Systems
Myhill--Nerode type theory for fuzzy languages and automata
Fuzzy Sets and Systems
Nondeterministic fuzzy automata
Information Sciences: an International Journal
Algebraic properties of LA-languages
Information Sciences: an International Journal
The relationships among several types of fuzzy automata
Information Sciences: an International Journal
Different Types of Linear Fuzzy Cellular Automata and their Applications
Fundamenta Informaticae - Membrane Computing
Algebraic properties of L-fuzzy finite automata
Information Sciences: an International Journal
Hi-index | 0.00 |
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 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 AFFLs 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.