2 papers
cs.FL2025
Parikh Automata on Finite and Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
We study Parikh automata on finite and infinite words. First we establish some results for Parikh automata on finite words. Following, we present several definitions of Parikh auto…
cs.LG2025
Learning Tree Pattern Transformations
Daniel Neider, Leif Sabellek, Johannes Schmidt +2
Explaining why and how a tree structurally differs from another tree is a question that is encountered throughout computer science, including in understanding tree-st…