Group separation strikes back

TL;DR

This paper presents a new automata-theoretic approach to decide separation and covering problems for group languages and their subclasses, providing algorithms with tight complexity bounds.

Contribution

It offers an automata-based decision procedure for separation and covering in group languages, independent of algebraic methods, and extends results to subclasses like modulo testable languages.

Findings

Decidability of separation for group languages and subclasses.

Algorithms with tight complexity bounds for these classes.

Independence from algebraic machinery in proofs.

Abstract

Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given two arbitrary regular languages as input, we show how to decide if there exists a group language containing the first one while being disjoint from the second. We prove that covering, a problem generalizing separation, is decidable. A simple covering algorithm was already known: it can be obtained indirectly as a corollary of an algebraic theorem by Ash. Unfortunately, while deducing the algorithm from this algebraic result is straightforward, all proofs of Ash's result itself require a strong background on algebraic concepts, and a wealth of technical machinery outside of automata theory. Our proof is independent of previous ones. It relies exclusively on standard notions from automata theory: we directly deal with separation and work with input languages represented by nondeterministic finite automata. We also investigate two strict subclasses. First, the alphabet modulo testable languages are those defined by counting the occurrences of each letter modulo some fixed integer (equivalently, they are the languages recognized by a commutative group). Secondly, the modulo languages are those defined by counting the length of words modulo some fixed integer. We prove that covering is decidable for both classes, with algorithms that rely on the construction made for group languages. Our proofs lead to tight complexity bounds for separation for all three classes, as well as for covering for both alphabet modulo testable languages and for modulo testable languages.