Skip to main content
Log in

Tree-systems of morphisms

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

Starting from the idea of determinism in membrane systems, we introduce a language generating device consisting of morphisms placed in the nodes of a tree. Initial strings are given in the leaves; by iteratively applying the morphisms to them, we produce new strings, which are collected in the root of the tree. Such a device is called a tree-system of morphisms (in short, a T system). We investigate here the power of T systems, both in the extended (a terminal alphabet is considered and only strings over it are accepted) and non-extended case, mainly in comparison with classes of languages in Lindenmayer hierarchy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 8 February 2001 / 18 September 2001

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dassow, J., Păun, G., Thierrin, G. et al. Tree-systems of morphisms. Acta Informatica 38, 131–153 (2001). https://doi.org/10.1007/s002360100072

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360100072

Navigation