Johannes Osterholzer

According to our database, Johannes Osterholzer authored at least 9 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2024

Non-Global Parikh Tree Automata.

Luisa Herrmann, Johannes Osterholzer

Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024

2019

Linear context-free tree languages and inverse homomorphisms.

Johannes Osterholzer, Toni Dietze, Luisa Herrmann

Inf. Comput., 2019

2018

New Results on Context-Free Tree Languages.

Johannes Osterholzer

PhD thesis, 2018

2015

A link between multioperator and tree valuation automata and logics.

Markus Teichmann, Johannes Osterholzer

Theor. Comput. Sci., 2015

A Direct Link between Tree-Adjoining and Context-Free Tree Grammars.

Kilian Gebhardt, Johannes Osterholzer

Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

Complexity of Uniform Membership of Context-Free Tree Grammars.

Johannes Osterholzer

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014

Pushdown Machines for Weighted Context-Free Tree Translation.

Johannes Osterholzer

Proceedings of the Implementation and Application of Automata, 2014

Weighted Automata and Logics for Natural Language Processing.

Johannes Osterholzer

Proceedings of the 8th Joint Workshop of the German Research Training Groups in Computer Science, 2014

2012

State-Split for Hypergraphs with an Application to Tree Adjoining Grammars.

Johannes Osterholzer, Torsten Stüber

Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012