2 citations · 9 across the 12 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.FL2018
Visibly Pushdown Languages over Sliding Windows
Moses Ganardi
We investigate the class of visibly pushdown languages in the sliding window model. A sliding window algorithm for a language receives a stream of symbols and has to decide at…
cs.LO2018
The Complexity of Bisimulation and Simulation on Finite Systems
Moses Ganardi, Stefan Göller, Markus Lohrey
In this paper the computational complexity of the (bi)simulation problem over restricted graph classes is studied. For trees given as pointer structures or terms the (bi)simulation…
cs.FL2018
Randomized sliding window algorithms for regular languages
Moses Ganardi, Danny Hucke, Markus Lohrey
A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last symbols. If the algorithm is rando…