Results 261 to 270 of about 2,416,094 (319)
Some of the next articles are maybe not open access.
International Journal of Computer Mathematics, 1990
Fuzzy L-systems are presented as a formal mechanism for generating fuzzy formal languages. This provides a mechanism for modelling development while also incorporating the vagueness inherent to most real world processes. In this paper, fuzzy L-systems are defined, a normal form is developed, closure properties of fuzzy L-systems—both language-theoretic
M. V. Nagendra Prasad +2 more
openaire +1 more source
Fuzzy L-systems are presented as a formal mechanism for generating fuzzy formal languages. This provides a mechanism for modelling development while also incorporating the vagueness inherent to most real world processes. In this paper, fuzzy L-systems are defined, a normal form is developed, closure properties of fuzzy L-systems—both language-theoretic
M. V. Nagendra Prasad +2 more
openaire +1 more source
Science in China Series F Information Sciences, 2002
This paper proposes the concept of generalized L systems, GL systems for short, which can describe asynchronized concurrent phenomena. We have proved that the GL systems are proper extensions of the traditional L systems. We have also defined a classification of GL systems and proved a sufficient and necessary condition for the equivalence of two ...
Ruqian Lu, Wenyan Zhang
openaire +1 more source
This paper proposes the concept of generalized L systems, GL systems for short, which can describe asynchronized concurrent phenomena. We have proved that the GL systems are proper extensions of the traditional L systems. We have also defined a classification of GL systems and proved a sufficient and necessary condition for the equivalence of two ...
Ruqian Lu, Wenyan Zhang
openaire +1 more source
Texture synthesis by L-systems
Image and Vision Computing, 1997We present a method for texture synthesis based on the extended L-systems, called TSL-systems, which are defined as a combination of parametric, stochastic and MAP L-systems. A description of primitives and their spatial relationship is given in terms of TSL-systems. The representation of texture characteristics is hierarchical.
Min-Lu Dai, Kazumasa Ozawa
openaire +1 more source
2011
In geometry objects are often defined by explicit rules and transformations which can easily be translated into mathematical formulae. For example, a circle is the set of all points which are at a fixed distance r from a centre. In contrast to this, the objects of fractal geometry are usually given by a recursion.
Michael Oberguggenberger +1 more
openaire +1 more source
In geometry objects are often defined by explicit rules and transformations which can easily be translated into mathematical formulae. For example, a circle is the set of all points which are at a fixed distance r from a centre. In contrast to this, the objects of fractal geometry are usually given by a recursion.
Michael Oberguggenberger +1 more
openaire +1 more source
ACM SIGPLAN Notices, 1995
L-objects are introduced as L-systems with some object-oriented extensions. Inheritance is the principal new feature of L-objects. We discuss both the abstract basis and the program implementation of the new L-systems technique. The L-objects programming language defined here brings new qualities to L-systems design: modularity, code reusability ...
openaire +1 more source
L-objects are introduced as L-systems with some object-oriented extensions. Inheritance is the principal new feature of L-objects. We discuss both the abstract basis and the program implementation of the new L-systems technique. The L-objects programming language defined here brings new qualities to L-systems design: modularity, code reusability ...
openaire +1 more source
International Journal of Pattern Recognition and Artificial Intelligence, 1990
Terminal weights are attached to L-systems by replacing each terminal generated by an OL-system by fa(i) in the ith step of a derivation. The family of terminal weighted OL languages will be equal to the recursively enumerable set. Terminal weights are attached to EOL-regular matrix languages and also to OL array languages.
Nalinakshi Nirmal, Raghavan Rama 0001
openaire +1 more source
Terminal weights are attached to L-systems by replacing each terminal generated by an OL-system by fa(i) in the ith step of a derivation. The family of terminal weighted OL languages will be equal to the recursively enumerable set. Terminal weights are attached to EOL-regular matrix languages and also to OL array languages.
Nalinakshi Nirmal, Raghavan Rama 0001
openaire +1 more source
1996
This paper characterizes the development of modular branching structures that satisfy three assumptions: (a) subapical branching, meaning that new branches can be created only near the apices of the existing branches, (b) finite number of module types and states, and (c) absence of interactions between coexisting components of the growing structure ...
Przemyslaw Prusinkiewicz, Lila Kari
openaire +1 more source
This paper characterizes the development of modular branching structures that satisfy three assumptions: (a) subapical branching, meaning that new branches can be created only near the apices of the existing branches, (b) finite number of module types and states, and (c) absence of interactions between coexisting components of the growing structure ...
Przemyslaw Prusinkiewicz, Lila Kari
openaire +1 more source