eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-11-29
46:1
46:13
10.4230/LIPIcs.FSTTCS.2021.46
article
Separating Regular Languages over Infinite Words with Respect to the Wagner Hierarchy
Hugenroth, Christopher
1
TU Ilmenau, Germany
We investigate the separation problem for regular ω-languages with respect to the Wagner hierarchy where the input languages are given as deterministic Muller automata (DMA). We show that a minimal separating DMA can be computed in exponential time and that some languages require separators of exponential size. Further, we show that in this setting it can be decided in polynomial time whether a separator exists on a certain level of the Wagner hierarchy and that emptiness of the intersection of two languages given by DMAs can be decided in polynomial time. Finally, we show that separation can also be decided in polynomial time if the input languages are given as deterministic parity automata.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol213-fsttcs2021/LIPIcs.FSTTCS.2021.46/LIPIcs.FSTTCS.2021.46.pdf
Separation
Regular
Wagner Hierarchy
Muller Automata
Parity Automata
Product Automata
Membership