The Component Hierarchy of Chain-free Cooperating Distributed Regular Tree Grammars Revisited
-
Published:2022-09-10
Issue:
Volume:
Page:1-17
-
ISSN:0129-0541
-
Container-title:International Journal of Foundations of Computer Science
-
language:en
-
Short-container-title:Int. J. Found. Comput. Sci.
Author:
Gazdag Zsolt1,
Vágvölgyi Sándor1
Affiliation:
1. Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Abstract
We denote by [Formula: see text] the class of tree languages generated by chain-free distributed regular tree grammars of [Formula: see text] components cooperating with terminal strategy. Dányi and Fülöp [2] showed that the hierarchy [Formula: see text], [Formula: see text] contains an infinite proper hierarchy. We improve their result showing that for each [Formula: see text], [Formula: see text].
Funder
Ministry for Innovation and Technology, Hungary
Publisher
World Scientific Pub Co Pte Ltd
Subject
Computer Science (miscellaneous)