Semirings, automata, languages
Semirings, automata, languages
Learning regular sets from queries and counterexamples
Information and Computation
Rational series and their languages
Rational series and their languages
Deciding equivalence of finite tree automata
SIAM Journal on Computing
Polynomial Time Learnability of Simple Deterministic Languages
Machine Learning
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Finite tree automata with cost functions
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
Handbook of formal languages, vol. 1
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
Algorithmic Program DeBugging
Automata, Languages, and Machines
Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Even linear simple matrix languages: formal language properties and grammatical inference
Theoretical Computer Science
Machine Learning
Machine Learning
Efficient Learning of Real Time One-Counter Automata
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science - Special issue: Algorithmic learning theory
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
Weighted tree automata and weighted logics
Theoretical Computer Science
Query Learning of Regular Tree Languages: How to Avoid Dead States
Theory of Computing Systems
Learning one-counter languages in polynomial time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Learning Rational Stochastic Tree Languages
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Minimizing Deterministic Weighted Tree Automata
Language and Automata Theory and Applications
Minimizing deterministic weighted tree automata
Information and Computation
Bisimulation minimisation for weighted tree automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Myhill-Nerode theorem for recognizable tree series revisited
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A randomised inference algorithm for regular tree languages
Natural Language Engineering
| Hi-index | 0.00 |
We devise a learning algorithm for deterministically recognizable tree series where the weights are taken from a commutative group. For this, we use an adaptation of the minimal adequate teacher model that was originally introduced by Angluin. The algorithm runs in polynomial time and constructs the unique minimal deterministic bottom-up finite state weighted tree automaton that recognizes the tree series in question.