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

• Autorzy: Truthe B.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

chain code picture systems; Lindenmayer systems

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2003
• Tom: Vol. 56, nr 4
• Strony: 389--409
• Opis fizyczny: bibliogr. 8 poz.

Twórcy

autor

Truthe B.

• Otto-von Guericke Universität Magdeburg, Fakultät für Informatik, PSF 4120, D-39016 Magdeburg , Germany,

Bibliografia

• 1. [DH89] DASSOW, J.; HINZ, F.: Kettencode-Bildsprachen. Theorie und Anwendungen. Wiss. Zeitschrift der Techn. Univ. Magdeburg, 1989.
• 2. [DHr92] DASSOW, J.; HROMKOVI ˇC, J.: On Synchronized Lindenmayer Picture Languages. Lindenmayer Systems, 253-261. Springer-Verlag, Berlin 1992.
• 3. [Fe68] FEDER, J.: Languages of encoded line patterns. Inform. Control, 13:230-244.
• 4. [Fr61] FREEMAN, H.: On the encoding of arbitrary geometric configurations. IRE Trans. EC, 10:260-168, 1961.
• 5. [MRW82] MAURER, H.; ROZENBERG, G.; WELZL, E.: Using string languages to describe picture languages. Inform. Control, 54:155-185, 1982.
• 6. [RS80] ROZENBERG, G.; SALOMAA, A.: The Mathematical Theory of L Systems. Academic Press, 1980.
• 7. [SW85] SUDBOROUGH, I. H.; WELZL, E.: Complexity and decidability for chain code picture languages. Theoretical Computer Science, 36:173-202, 1985.
• 8. [T02] TRUTHE, B.: On the Finiteness of Picture Languages of Synchronous Deterministic Chain Code Picture Systems. To appear. (see also Zur Endlichkeit von Bildsprachen synchroner deterministischer Ketten-Code-Bild-Systeme. Otto-von-Guericke-Universit¨at Magdeburg, Preprint Nr. 8/2002.)