On injectivity of deterministic top-down tree transducers

被引：0
|
作者：
机构：
[1] Fulop, Z.
来源：
Fulop, Z | 1600年 / 48期
关键词：
Theory of computation - Topdown tree transducers - Tree codes - Undecidability;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] ON INJECTIVITY OF DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS
    FULOP, Z
    GYENIZSE, P
    [J]. INFORMATION PROCESSING LETTERS, 1993, 48 (04) : 183 - 188
  • [2] Superlinear Deterministic Top-down Tree Transducers
    [J]. Bull Eur Assoc Theor Comput Sci, 64 (352):
  • [3] Superlinear deterministic top-down tree transducers
    Danyi, G
    Fulop, Z
    [J]. MATHEMATICAL SYSTEMS THEORY, 1996, 29 (05): : 507 - 534
  • [4] TOP-DOWN TREE-TRANSDUCERS WITH DETERMINISTIC TOP-DOWN LOOK-AHEAD
    FULOP, Z
    VAGVOLGYI, S
    [J]. INFORMATION PROCESSING LETTERS, 1989, 33 (01) : 3 - 5
  • [5] UNDECIDABLE PROPERTIES OF DETERMINISTIC TOP-DOWN TREE-TRANSDUCERS
    FULOP, Z
    [J]. THEORETICAL COMPUTER SCIENCE, 1994, 134 (02) : 311 - 328
  • [6] Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations
    Loding, Christof
    Winter, Sarah
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (161): : 88 - 101
  • [7] Synthesis of deterministic top-down tree transducers from automatic tree relations
    Loeding, Christof
    Winter, Sarah
    [J]. INFORMATION AND COMPUTATION, 2017, 253 : 336 - 354
  • [8] Node Query Preservation for Deterministic Linear Top-Down Tree Transducers
    Miyahara, Kazuki
    Hashimoto, Kenji
    Seki, Hiroyuki
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (03): : 512 - 523
  • [9] Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
    Seidl, Helmut
    Maneth, Sebastian
    Kemper, Gregor
    [J]. JOURNAL OF THE ACM, 2018, 65 (04)
  • [10] Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
    Seidl, Helmut
    Maneth, Sebastian
    Kemper, Gregor
    [J]. 2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 943 - 962
12345