Complexity of equivalence and learning for multiplicity tree automata

被引：0
|
作者：
Department of Computer Science, University of Oxford, Parks Road, Oxford [1 ]
OX1 3QD, United Kingdom
机构：
来源：
J. Mach. Learn. Res. | 1600年 / 2465-2500期
关键词：
Engineering Village;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
DAG representations of trees - Exact learning - Hankel matrix - Polynomial identity testing - Query complexity - Tree automata
引用
收藏
相关论文
共 50 条
  • [31] Parameterized complexity of basic decision problems for tree automata
    Charatonik, Witold
    Chorowska, Agata
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2013, 90 (06) : 1150 - 1170
  • [32] Operational State Complexity of Deterministic Unranked Tree Automata
    Piao, Xiaoxue
    Salomaa, Kai
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (31): : 149 - 158
  • [33] Optimization of Equivalence Query Algorithm in Active Automata Learning
    Pan Y.
    Zhu Y.-F.
    Ruan Jian Xue Bao/Journal of Software, 2023, 34 (07): : 3241 - 3255
  • [34] The complexity of tree automata and XPath on grammar-compressed trees
    Lohrey, Markus
    Maneth, Sebastian
    THEORETICAL COMPUTER SCIENCE, 2006, 363 (02) : 196 - 210
  • [35] ALTERNATING AUTOMATA, THE WEAK MONADIC THEORY OF THE TREE, AND ITS COMPLEXITY
    MULLER, DE
    SAOUDI, A
    SCHUPP, PE
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 226 : 275 - 283
  • [36] A Categorical Framework for Learning Generalised Tree Automata
    van Heerdt, Gerco
    Kappe, Tobias
    Rot, Jurriaan
    Sammartino, Matteo
    Silva, Alexandra
    COALGEBRAIC METHODS IN COMPUTER SCIENCE (CMCS 2022), 2022, 13225 : 67 - 87
  • [37] Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
    Paul, Erik
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2024, 35 (01N02) : 23 - 49
  • [38] LOGICAL COMPLEXITY OF SOME CLASSES OF TREE-LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA
    BUSZKOWSKI, W
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1980, 26 (01): : 41 - 49
  • [39] WEAK EQUIVALENCE OF AUTOMATA
    RYSTOV, IK
    CYBERNETICS, 1990, 26 (05): : 737 - 742
  • [40] Scalable Tree-based Register Automata Learning
    Dierl, Simon
    Fiterau-Brostean, Paul
    Howar, Falk
    Jonsson, Bengt
    Sagonas, Konstantinos
    Taquist, Fredrik
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2024, 2024, 14571 : 87 - 108
12345