Regular tree languages and rewrite systems

被引：0
|
作者：
机构：
来源：
Fundam Inf | / 1-2卷 / 157期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] PUMPING LEMMAS FOR TREE-LANGUAGES GENERATED BY REWRITE SYSTEMS
    KOUNALIS, E
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 369 - 377
  • [2] Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems
    Boichut, Yohan
    Pelletier, Vivien
    Rety, Pierre
    REWRITING LOGIC AND ITS APPLICATIONS, WRLA 2016, 2016, 9942 : 64 - 81
  • [3] Learning of Regular ω-Tree Languages
    Jayasrirani, M.
    Begam, M. H.
    Thomas, D. G.
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2008, 5278 : 295 - +
  • [4] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
    Goeller, Stefan
    Lin, Anthony Widjaja
    CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 543 - +
  • [5] Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems
    Goeller, Stefan
    Lin, Anthony Widjaja
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2014, 15 (04)
  • [6] Priority Rewrite Systems for OSOS process languages
    Ulidowski, I
    CONCUR 2003 - CONCURRENCY THEORY, 2003, 2761 : 87 - 102
  • [7] Senescent Ground Tree Rewrite Systems
    Hague, M.
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [8] On topological completeness of regular tree languages
    Michalewski, H. (H.Michalewski@mimuw.edu.pl), 1600, Springer Verlag (7230 LNCS):
  • [9] Regular tree languages and quasi orders
    Petkovic, Tatjana
    ACTA CYBERNETICA, 2006, 17 (04): : 811 - 823
  • [10] Regular tree languages definable in FO
    Benedikt, M
    Segoufin, L
    STACS 2005, PROCEEDINGS, 2005, 3404 : 327 - 339
12345