We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show that (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languag...
Fuzzy logic is a logic of approximate reasoning, established by Lotfi Zadeh since 1965 in his work [...
The paper is about some families of rewriting P systems, where the application of evolution rules i...
A hyper-AFL is an abstract family of languages which is closed under iterated (parallel) substitutio...
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of ce...
AbstractWe study operations on fuzzy languages such as union, concatenation, Kleene ★, intersection ...
We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, intersection wi...
We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with reg...
In this paper, we study fuzzy graph rewriting with automaton and regular expression. We use hedge al...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
Different learning algorithms based on learning from examples are described based on a set of graph ...
In this paper we explore forms of organization of rewriting systems which allow the systematic model...
This paper represents a study of reversibility in parallel rewriting systems over multisets. It emph...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
Fuzzy logic is a logic of approximate reasoning, established by Lotfi Zadeh since 1965 in his work [...
The paper is about some families of rewriting P systems, where the application of evolution rules i...
A hyper-AFL is an abstract family of languages which is closed under iterated (parallel) substitutio...
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of ce...
AbstractWe study operations on fuzzy languages such as union, concatenation, Kleene ★, intersection ...
We study operations on fuzzy languages such as union, concatenation, Kleene $\star$, intersection wi...
We study operations on fuzzy languages such as union, concatenation, Kleene ⋆, intersection with reg...
In this paper, we study fuzzy graph rewriting with automaton and regular expression. We use hedge al...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
We investigate derivation-controlled $K$-iteration grammars, called $(\Gamma,K)$-iteration grammars,...
The notion of a K-iteration grammar, where K is a family of languages, provides a uniform framework ...
Different learning algorithms based on learning from examples are described based on a set of graph ...
In this paper we explore forms of organization of rewriting systems which allow the systematic model...
This paper represents a study of reversibility in parallel rewriting systems over multisets. It emph...
The stable string operation selects from the strings produced by a rewriting system those strings wh...
Fuzzy logic is a logic of approximate reasoning, established by Lotfi Zadeh since 1965 in his work [...
The paper is about some families of rewriting P systems, where the application of evolution rules i...
A hyper-AFL is an abstract family of languages which is closed under iterated (parallel) substitutio...