A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. - Luisa Herrmann 001; Heiko Vogler (CAI, 2015)

Weighted Symbolic Automata with Data Storage. - Luisa Herrmann 001; Heiko Vogler (DLT, 2016)

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. - Heiko Vogler; Manfred Droste; Luisa Herrmann 001 (LATA, 2016)

A Medvedev Characterization of Recognizable Tree Series. - Luisa Herrmann 001 (DLT, 2017)

Weighted Regular Tree Grammars with Storage. - Zoltán Fülöp 001; Luisa Herrmann 001; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2018)

Weighted automata with storage. - Luisa Herrmann 001; Heiko Vogler; Manfred Droste (Inf. Comput., 2019)

Linear context-free tree languages and inverse homomorphisms. - Johannes Osterholzer; Toni Dietze; Luisa Herrmann 001 (Inf. Comput., 2019)

Linear weighted tree automata with storage and inverse linear tree homomorphisms. - Luisa Herrmann 001 (Inf. Comput., 2021)

Weighted Automata with Storage. - Luisa Herrmann 001 (2021)

Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures. - Luisa Herrmann 001; Sebastian Rudolph (CoRR, 2023)

Decidable (Ac)counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures. - Luisa Herrmann 001; Vincent Peth; Sebastian Rudolph (CSL, 2024)

Global One-Counter Tree Automata. - Luisa Herrmann 001; Richard Mörbitz (CIAA, 2024)

Non-Global Parikh Tree Automata. - Luisa Herrmann 001; Johannes Osterholzer (NCMA, 2024)