# Separation and the Successor Relation

LIPICS - Leibniz International Proceedings in Informatics, Feb 2015

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the second. These problems are considered as means to obtain a deep understanding of the class C. It is usual for such classes to be defined by logical formalisms. Logics are often built on top of each other, by adding new predicates. A natural construction is to enrich a logic with the successor relation. In this paper, we obtain new and simple proofs of two transfer results: we show that for suitable logically defined classes, the membership, resp. the separation problem for a class enriched with the successor relation reduces to the same problem for the original class. Our reductions work both for languages of finite words and infinite words. The proofs are mostly self-contained, and only require a basic background on regular languages. This paper therefore gives simple proofs of results that were considered as difficult, such as the decidability of the membership problem for the levels 1, 3/2, 2 and 5/2 of the dot-depth hierarchy.

This is a preview of a remote PDF: http://drops.dagstuhl.de/opus/volltexte/2015/4949/pdf/49.pdf

Thomas Place, Marc Zeitoun. Separation and the Successor Relation, LIPICS - Leibniz International Proceedings in Informatics, 2015, 662-675, DOI: 10.4230/LIPIcs.STACS.2015.662