1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.CC2023★ 1 cited
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
cs.FL2023
Büchi-like characterizations for Parikh-recognizable omega-languages
Mario Grobler, Sebastian Siebertz
Büchi's theorem states that -regular languages are characterized as languages of the form , where and are regular languages. Parikh automata are…
cs.FL2023★ 1 cited
Parikh Automata on Infinite Words
Mario Grobler, Leif Sabellek, Sebastian Siebertz
Parikh automata on finite words were first introduced by Klaedtke and Rueß [Automata, Languages and Programming, 2003]. In this paper, we introduce several variants of Parikh autom…