A Chomsky-Schützenberger theorem for weighted automata with storage L Herrmann, H Vogler International Conference on Algebraic Informatics, 115-127, 2015 | 20 | 2015 |
A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem H Vogler, M Droste, L Herrmann Language and Automata Theory and Applications, 127-139, 2016 | 17 | 2016 |
Weighted Symbolic Automata with Data Storage L Herrmann, H Vogler International Conference on Developments in Language Theory, 203-215, 2016 | 11 | 2016 |
Weighted automata with storage L Herrmann, H Vogler, M Droste Information and Computation 269, 104447, 2019 | 9 | 2019 |
Weighted Regular Tree Grammars with Storage H Vogler, L Herrmann, Z Fülöp Discrete Mathematics & Theoretical Computer Science 20, 2018 | 9* | 2018 |
Linear context-free tree languages and inverse homomorphisms J Osterholzer, T Dietze, L Herrmann Information and Computation 269, 104454, 2019 | 4 | 2019 |
A Medvedev Characterization of Recognizable Tree Series L Herrmann International Conference on Developments in Language Theory, 210-221, 2017 | 2 | 2017 |
Decidable (Ac) counting with Parikh and Muller: Adding Presburger Arithmetic to Monadic Second-Order Logic over Tree-Interpretable Structures L Herrmann, S Rudolph arXiv preprint arXiv:2305.01962, 2023 | 1 | 2023 |
Linear context-free tree languages and inverse homomorphisms J Osterholzer, T Dietze, L Herrmann arXiv preprint arXiv:1510.04881, 2015 | 1 | 2015 |
Linear weighted tree automata with storage and inverse linear tree homomorphisms L Herrmann Information and Computation 281, 104816, 2021 | | 2021 |
Weighted Regular Tree Grammars with Storage Z Fülöp, L Herrmann, H Vogler arXiv preprint arXiv:1705.06681, 2017 | | 2017 |
Closure of Regular Tree Languages under Application of the Inverse of YIELD L Herrmann | | |