Sebastian Siebertz

activity

20142023

most citedNeighborhood complexity and kernelization for nowhere dense classes of graphs

6 citations · 13 across the 7 of their papers we have counts for

collaborators

Showing cs.FLShow all

2 papers · 1 filter

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 $⋃_{i} U_{i} V_{i}^{ω}$ , where $U_{i}$ and $V_{i}$ 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…