Dot-depth three, return of the J-class

TL;DR

This paper provides an algebraic characterization of concatenation hierarchies of regular languages, showing that membership decision at higher levels reduces to covering problems at lower levels, leading to decidability results for certain hierarchies.

Contribution

It introduces a generic algebraic characterization of the Boolean polynomial closure operator, enabling decidability results for levels in concatenation hierarchies.

Findings

Decidability of membership at level three in dot-depth hierarchy.

Decidability of level two membership in modulo and group hierarchies.

Reduction of membership problems to covering problems at lower levels.

Abstract

We look at concatenation hierarchies of classes of regular languages. Each such hierarchy is determined by a single class, its basis: level $n$ is built by applying the Boolean polynomial closure operator (BPol), $n$ times to the basis. A prominent and difficult open question in automata theory is to decide membership of a regular language in a given level. For instance, for the historical dot-depth hierarchy, the decidability of membership is only known at levels one and two. We give a generic algebraic characterization of the operator BPol. This characterization implies that for any concatenation hierarchy, if $n$ is at least two, membership at level $n$ reduces to a more complex problem, called covering, for the previous level, $n-1$. Combined with earlier results on covering, this implies that membership is decidable for dot-depth three and for level two in most of the prominent hierarchies in the literature. For instance, we obtain that the levels two in both the modulo hierarchy and the group hierarchy have decidable membership.