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 条
  • [41] Spectral Multiplicity of General Automata
    Queffelec, Martine
    SUBSTITUTION DYNAMICAL SYSTEMS: SPECTRAL ANALYSIS, SECOND EDITION, 2010, 1294 : 265 - 280
  • [42] Complexity Results on Register Context-Free Grammars and Register Tree Automata
    Senda, Ryoma
    Takata, Yoshiaki
    Seki, Hiroyuki
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2018, 2018, 11187 : 415 - 434
  • [43] Tree Learning: Optimal Sample Complexity and Algorithms
    Avdiukhin, Dmitrii
    Yaroslavtsev, Grigory
    Vainstein, Danny
    Fischer, Orr
    Das, Sauman
    Mirza, Faraz
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 6, 2023, : 6701 - 6708
  • [44] Tree Learning: Optimal Sample Complexity and Algorithms
    Avdiukhin, Dmitrii
    Yaroslavtsev, Grigory
    Vainstein, Danny
    Fischer, Orr
    Das, Sauman
    Mirza, Faraz
    Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023, 2023, 37 : 6701 - 6708
  • [45] Parameterized Complexity of Small Decision Tree Learning
    Ordyniak, Sebastian
    Szeider, Stefan
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6454 - 6462
  • [46] Hybrid tree automata and the yield theorem for constituent tree automata
    Drewes, Frank
    Moerbitz, Richard
    Vogler, Heiko
    THEORETICAL COMPUTER SCIENCE, 2023, 979
  • [47] On the equivalence of Z-automata
    Béal, MP
    Lombardy, S
    Sakarovitch, J
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 397 - 409
  • [48] Generalized Statistical Equivalence of Automata
    A. S. Barashko
    Cybernetics and Systems Analysis, 2000, 36 : 784 - 785
  • [49] Generalized statistical equivalence of automata
    Barashko, AS
    CYBERNETICS AND SYSTEMS ANALYSIS, 2000, 36 (05) : 784 - 785
  • [50] WEAK EQUIVALENCE OF FINITE AUTOMATA
    PLAKSIN, VA
    ENGINEERING CYBERNETICS, 1979, 17 (06): : 90 - 95
12345