13 citations · 46 across the 14 of their papers we have counts for
3 papers · 2 filters
Recurrent Neural Networks as Weighted Language Recognizers
Yining Chen, Sorcha Gilroy, Andreas Maletti +2
We investigate the computational complexity of various problems for simple recurrent neural networks (RNNs) as formal models for recognizing weighted languages. We focus on the sin…
Multiple Context-Free Tree Grammars: Lexicalization and Characterization
Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous ca…
Pushing for weighted tree automata
Thomas Hanneforth, Andreas Maletti, Daniel Quernheim
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized we…