The copying power of one-state tree transducers

Joost Engelfriet, Sven Skyum

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
32 Downloads (Pure)

Abstract

One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copying," i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.
Original languageEnglish
Pages (from-to)418-435
JournalJournal of computer and system sciences
Volume25
Issue number3
DOIs
Publication statusPublished - 1982

Fingerprint

Copying
Transducer
Transducers
Context free languages
Polynomials
Context-free Languages
Prime factor
Homomorphisms
Strings
Closed
Polynomial
Integer
Output
Range of data
Language
Class

Cite this

Engelfriet, Joost ; Skyum, Sven. / The copying power of one-state tree transducers. In: Journal of computer and system sciences. 1982 ; Vol. 25, No. 3. pp. 418-435.
@article{97d07b9bcf374452bac1dda2ae5ca02e,
title = "The copying power of one-state tree transducers",
abstract = "One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle {"}prime copying,{"} i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.",
author = "Joost Engelfriet and Sven Skyum",
year = "1982",
doi = "10.1016/0022-0000(82)90019-8",
language = "English",
volume = "25",
pages = "418--435",
journal = "Journal of computer and system sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

The copying power of one-state tree transducers. / Engelfriet, Joost; Skyum, Sven.

In: Journal of computer and system sciences, Vol. 25, No. 3, 1982, p. 418-435.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - The copying power of one-state tree transducers

AU - Engelfriet, Joost

AU - Skyum, Sven

PY - 1982

Y1 - 1982

N2 - One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copying," i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.

AB - One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copying," i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.

U2 - 10.1016/0022-0000(82)90019-8

DO - 10.1016/0022-0000(82)90019-8

M3 - Article

VL - 25

SP - 418

EP - 435

JO - Journal of computer and system sciences

JF - Journal of computer and system sciences

SN - 0022-0000

IS - 3

ER -