Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Osterholzer, Johannes"'
Autor:
Herrmann, Luisa, Osterholzer, Johannes
Publikováno v:
EPTCS 407, 2024, pp. 100-117
Parikh (tree) automata are an expressive and yet computationally well-behaved extension of finite automata -- they allow to increment a number of counters during their computations, which are finally tested by a semilinear constraint. In this work, w
Externí odkaz:
http://arxiv.org/abs/2409.06973
Autor:
Osterholzer, Johannes
Context-free tree languages play an important role in algebraic semantics and are applied in mathematical linguistics. In this thesis, we present some new results on context-free tree languages.
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A30972
https://tud.qucosa.de/api/qucosa%3A30972/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A30972/attachment/ATT-0/
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a certain lin
Externí odkaz:
http://arxiv.org/abs/1510.04881
Publikováno v:
In Information and Computation December 2019 269
Publikováno v:
In Theoretical Computer Science 23 August 2015 594:106-119
Publikováno v:
Language & Automata Theory & Applications: 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings; 2016, p478-489, 12p
Autor:
Osterholzer, Johannes
Publikováno v:
Model & Data Engineering: 5th International Conference, MEDI 2015, Rhodes, Greece, September 26-28, 2015, Proceedings; 2015, p176-188, 13p
Autor:
Osterholzer, Johannes
Publikováno v:
Implementation & Application of Automata: 19th International Conference, CIAA 2014, Giessen, Germany, July 30 - August 2, 2014. Proceedings; 2014, p290-303, 14p