Linear languages with a nonassociative concatenation
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
A note on cut-worthiness of recognizable tree series
Fuzzy Sets and Systems
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Weighted tree-walking automata
Acta Cybernetica
Recognizable tree series with discounting
Acta Cybernetica
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Efficient inference through cascades of weighted tree transducers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Preservation of recognizability for synchronous tree substitution grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Minimizing weighted tree grammars using simulation
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
An alternative to synchronous tree substitution grammars*
Natural Language Engineering
Code selection by tree series transducers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Valuations of weighted automata: doing it in a rational way
Algebraic Foundations in Computer Science
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae
Preservation of recognizability for weighted linear extended top-down tree transducers
ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing
| Hi-index | 0.89 |