Change search
ReferencesLink to record
Permanent link

Direct link
The Generative Power of Delegation Networks
Umeå University, Faculty of Science and Technology, Department of Computing Science. (Natural and Formal Languages)
Leiden Institute of Advanced Computer Science.
2015 (English)In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 245, 78 p.213-258 p.Article in journal (Refereed) Published
Abstract [en]

A device that generates trees over a ranked alphabet, together with an interpretation of the symbols in that alphabet as functions or relations on some domain, generates subsets of that domain. This concept of tree-based generators is well known and essentially already present in the seminal paper by Mezei and Wright from 1967. A delegation network is a system consisting of a finite set of such generators that can "delegate" parts of the generation process to each other. It can be viewed as consisting of an (extended) IO context-free tree grammar and an interpretation. We investigate the language-theoretic properties of these systems and establish several characterizations of the generated languages. In particular, we obtain results in the style of Mezei and Wright. We also study the hierarchy of tree language classes obtained by iterating the concept of delegation, and show that this hierarchy is properly contained in the closure of the regular tree languages under nondeterministic macro tree transductions, but not contained in the IO-hierarchy.

Place, publisher, year, edition, pages
2015. Vol. 245, 78 p.213-258 p.
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:umu:diva-101493DOI: 10.1016/j.ic.2015.04.005ISI: 000368899100014OAI: diva2:799737
Available from: 2015-03-31 Created: 2015-03-31 Last updated: 2016-05-17Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Drewes, Frank
By organisation
Department of Computing Science
In the same journal
Information and Computation
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 159 hits
ReferencesLink to record
Permanent link

Direct link