共 50 条
- [41] Complexity of equivalence and learning for multiplicity tree automata J. Mach. Learn. Res., 1600, (2465-2500):
- [43] Complexity of Equivalence and Learning for Multiplicity Tree Automata MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 414 - 425
- [45] Decidability of the minimization of fuzzy tree automata with membership values in complete lattices Journal of Applied Mathematics and Computing, 2022, 68 : 461 - 478
- [46] Algorithmic Formal Proof of Equivalence of Nondeterministic and Deterministic Finite Automata ICECT: 2009 INTERNATIONAL CONFERENCE ON ELECTRONIC COMPUTER TECHNOLOGY, PROCEEDINGS, 2009, : 108 - +
- [47] EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA INFORMATION AND CONTROL, 1974, 25 (02): : 123 - 133