A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
[article]
2021
arXiv
pre-print
In the Intersection Non-Emptiness problem, we are given a list of finite automata A_1,A_2,...,A_m over a common alphabet Σ as input, and the goal is to determine whether some string w∈Σ^* lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-Emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata
arXiv:2110.01279v1
fatcat:snxam2lzsnclrkzsyv3b3gphme