Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields

New Linear-time Algorithm for SubTree Kernel Computation based on Root-Weighted Tree Automata

Tree kernels have been proposed to be used in many areas as the automatic learning of natural language applications. In this paper, we propose a new linear time algorithm based on the concept of weighted tree automata fo…

Simulating Weighted Automata over Sequences and Trees with Transformers

Transformers are ubiquitous models in the natural language processing (NLP) community and have shown impressive empirical successes in the past few years. However, little is understood about how they reason and the limit…

Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization

Low-Rank Approximation of Weighted Tree Automata

We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposi…

Complexity of Equivalence and Learning for Multiplicity Tree Automata

We consider the complexity of equivalence and learning for multiplicity tree automata, i.e., weighted tree automata over a field. We first show that the equivalence problem is logspace equivalent to polynomial identity t…