Relating word and tree automata

被引：18
|
作者：
Kupferman, O [1 ]
Safra, S [1 ]
Vardi, MY [1 ]
机构：
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
来源：
11TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 1996年
关键词：
D O I：
10.1109/LICS.1996.561360
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：322 / 332
页数：11
相关论文
共 50 条
  • [41] Tree pattern mining with tree automata constraints
    de Amo, Sandra
    Silva, Nyara A.
    Silva, Ronaldo P.
    Pereira, Fabiola S.
    INFORMATION SYSTEMS, 2010, 35 (05) : 570 - 591
  • [42] TREE AUTOMATA, TREE DECOMPOSITION AND HYPEREDGE REPLACEMENT
    LAUTEMANN, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 532 : 520 - 537
  • [43] From Tree Automata to Rational Tree Expressions
    Guellouma, Younes
    Cherroun, Hadda
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (06) : 1045 - 1062
  • [44] Relating Reachability Problems in Timed and Counter Automata
    Haase, Christoph
    Ouaknine, Joel
    Worrell, James
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 317 - 338
  • [45] Disambiguation of Weighted Tree Automata
    Stier, Kevin
    Ulbricht, Markus
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2021, 2021, 13037 : 163 - 175
  • [46] Bisimulation minimization of tree automata
    Abdulla, Parosh Aziz
    Kaati, Lisa
    Hogberg, Johanna
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 4094 : 173 - 185
  • [47] On Minimizing Deterministic Tree Automata
    Cleophas, Loek
    Kourie, Derrick C.
    Strauss, Tinus
    Watson, Bruce W.
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 173 - 182
  • [48] Weighted Tree Automata with Constraints
    Andreas Maletti
    Andreea-Teodora Nász
    Theory of Computing Systems, 2024, 68 (1) : 1 - 28
  • [49] On the Strength of Unambiguous Tree Automata
    Michalewski, Henryk
    Skrzypczak, Michel
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (05) : 911 - 933
  • [50] Vector addition tree automata
    de Groote, P
    Guillaume, B
    Salvati, S
    19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2004, : 64 - 73
12345