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 条
  • [1] Complexity of Equivalence and Learning for Multiplicity Tree Automata
    Marusic, Ines
    Worrell, James
    JOURNAL OF MACHINE LEARNING RESEARCH, 2015, 16 : 2465 - 2500
  • [2] Complexity of Equivalence and Learning for Multiplicity Tree Automata
    Marusic, Ines
    Worrell, James
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 414 - 425
  • [3] Learning multiplicity tree automata
    Habrard, Amaury
    Oncina, Jose
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2006, 4201 : 268 - 280
  • [4] Learning behaviors of automata from multiplicity and equivalence queries
    Bergadano, F
    Varricchio, S
    SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1268 - 1280
  • [5] Minimisation of Multiplicity Tree Automata
    Kiefer, Stefan
    Marusic, Ines
    Worrell, James
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 297 - 311
  • [6] MINIMISATION OF MULTIPLICITY TREE AUTOMATA
    Kiefer, Stefan
    Marusic, Ines
    Worrell, James
    LOGICAL METHODS IN COMPUTER SCIENCE, 2017, 13 (01)
  • [7] METRIC EQUIVALENCE OF TREE AUTOMATA
    GECSEG, F
    ACTA SCIENTIARUM MATHEMATICARUM, 1985, 48 (1-4): : 163 - 171
  • [8] On the Complexity of the Equivalence Problem for Probabilistic Automata
    Kiefer, Stefan
    Murawski, Andrzej S.
    Ouaknine, Joel
    Wachter, Bjoern
    Worrell, James
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, FOSSACS 2012, 2012, 7213 : 467 - 481
  • [9] Learning unary output two-tape automata from multiplicity and equivalence queries
    Melideo, G
    Varricchio, S
    ALGORITHMIC LEARNING THEORY, 1998, 1501 : 87 - 102
  • [10] DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA
    SEIDL, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 480 - 492
12345