State-Split for Hypergraphs with an Application to Tree Adjoining Grammars. - Johannes Osterholzer; Torsten Stüber (TAG, 2012)

Weighted Automata and Logics for Natural Language Processing. - Johannes Osterholzer (Joint Workshop of the German Research Training Groups in Computer Science, 2014)

Pushdown Machines for Weighted Context-Free Tree Translation. - Johannes Osterholzer (CIAA, 2014)

Complexity of Uniform Membership of Context-Free Tree Grammars. - Johannes Osterholzer (CAI, 2015)

A Direct Link between Tree-Adjoining and Context-Free Tree Grammars. - Kilian Gebhardt; Johannes Osterholzer (FSMNLP, 2015)

A link between multioperator and tree valuation automata and logics. - Markus Teichmann; Johannes Osterholzer (Theor. Comput. Sci., 2015)

New Results on Context-Free Tree Languages. - Johannes Osterholzer (2018)

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

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