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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 8 February 2001 / 18 September 2001
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/s002360100072