Wyniki wyszukiwania - BazTech

Ograniczanie wyników

4 Fundamenta Informaticae

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Lindenmayer systems

Sortuj według:

Ogranicz wyniki do:

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited

Bordihn H., Holzer M.

Fundamenta Informaticae

2007

Vol. 76, nr 3

255-270

Based on a derivation mode f for cooperating distributed (CD) grammar systems, we introduce a new form of cooperation protocol, the so called "cut-f-mode" of derivation. Intuitively, in the cut-f-mode of derivation the sentential form is partitioned (cut) into several subwords, where some of these subwords are distributed to the components, which derive them according to the underlying f-mode of derivation, and finally the new sentential form is obtained by concatenating all the subwords-derived or not-in their original order. According to the original motivation from distributed artificial intelligence, the new functioning mode appears to be more realistic than the original model. We investigate the cut-mode versions of the basic derivation modes and some of their combined versions. It turns out that in most cases, the cut-f-mode is at most as powerful as the corresponding non-cut-mode, that is, the f-mode itself. In some cases the power is even reduced to that of context-free grammars.

Active Symbols in Pure Systems

Bensch S., Bordihn H.

Fundamenta Informaticae

2007

Vol. 76, nr 3

239-254

In this paper, we consider the number of (statically measured) active symbols for Lindenmayer systems without interaction and some variants thereof as well as for pure CD grammar systems, where no distinction between terminal and nonterminal symbols is made. This measure of descriptional complexity gives rise to infinite hierarchies in all cases considered here. Moreover, all the devices under consideration are compared with respect to their generative power when the number of active symbols is bounded. Finally, some closure and many non-closure properties of the corresponding language families with a fixed number of active symbols are proved.

On the Finiteness of Picture Languages of synchronous, simple non-deterministic Chain Code Picture Systems

Truthe B.

Fundamenta Informaticae

2003

Vol. 56, nr 4

389-409

In the present paper, synchronous, simple non-deterministic chain code picture systems based on Lindenmayer systems () are studied the finiteness of their picture languages. The finiteness is proved to be decidable. Additionally, a method is given for deciding whether an generates a finite picture language or not.

Valences in Lindenmayer systems

Fernau H., Stiebe R.

Fundamenta Informaticae

2001

Vol. 45, nr 4

329-358

We investigate four variants of valence regulations incorporated in (limited) Lindenmayer systems, focussing on hierarchical relations and closure properties. Strong connections to well-known families of languages obtained by regulated rewriting are established. We prove several new results on valence transducers and valence generalized sequential machines (gsm). In this way, we can show new properties of ET0L languages, namely the non-closure under quasiintersection, valence gsm mappings and intersection with regular valence languages. Moreover, we solve a question marked as open in by proving that the uniformly k-limited ET0L languages form a full semi-AFL for all k > 1.