A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
It is proved that in every concatenation hierarchy of regular languages, decidability of one of its half levels, obtained by polynomial closure, implies decidability of the intersection of the following half level with its complement. In terms of the quantifier-alternation hierarchy of sentences in the first-order logic of finite words, this means that decidability of (definability in) the Σn fragment implies that of ∆n+1. In particular, the decidability of ∆5 is obtained.doi:10.1007/978-3-319-21500-6_4 fatcat:tyhp3ovqsbafzez37kkxjvskme