research
∙
02/25/2023
The 𝖠𝖢^0-Complexity Of Visibly Pushdown Languages
We concern ourselves with the question which visibly pushdown languages ...
share
research
∙
11/13/2020
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
Parametric timed automata (PTA) are an extension of timed automata in wh...
research
∙
05/13/2020
Bisimulation Finiteness of Pushdown Systems Is Elementary
We show that in case a pushdown system is bisimulation equivalent to a f...
research
∙
02/14/2019
On long words avoiding Zimin patterns
A pattern is encountered in a word if some infix of the word is the imag...
research
∙
06/01/2018
