Complexity of equivalence and learning for multiplicity tree automata
<p xmlns:etd="http://www.ouls.ox.ac.uk/ora/modsextensions">We consider the query and computational complexity of learning multiplicity tree automata in Angluin's exact learning model. In this model, there is an oracle, called the Teacher, that can answer membership and equivalen...
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | Journal article |
| منشور في: |
Journal of Machine Learning Research
2015
|