Separating Regular Languages by Piecewise Testable and Unambiguous Languages

Separation is a classical problem asking whether, given two sets belonging to some class, it is possible to separate them by a set from another class. We discuss the separation problem for regular languages. We give a Ptime algorithm to check whether two given regular languages are separable by a piecewise testable language, that is, whether a \(\mathcal{B}\Sigma_1(<)\) sentence can witness that the languages are disjoint. The proof refines an algebraic argument from Almeida and the third author. When separation is possible, we also express a separator by saturating one of the original languages by a suitable congruence. Following the same line, we show that one can as well decide whether two regular languages can be separated by an unambiguous language, albeit with a higher complexity.

[1]  Wim Martens,et al.  Efficient Separability of Regular Languages by Subsequences and Suffixes , 2013, ICALP.

[2]  M. Schützenberger,et al.  Sur Le Produit De Concatenation Non Ambigu , 1976 .

[3]  Lorijn van Rooijen,et al.  The separation problem for regular languages by piecewise testable languages , 2013, ArXiv.

[4]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[5]  Pascal Weil,et al.  Polynomial closure and unambiguous product , 1995, Theory of Computing Systems.

[6]  Thomas Wilke,et al.  Over words, two variables are as powerful as one quantifier alternation , 1998, STOC '98.

[7]  Karsten Henckell,et al.  Pointlike sets: the finest aperiodic cover of a finite semigroup , 1988 .

[8]  Christopher J. Ash,et al.  Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures , 1991, Int. J. Algebra Comput..

[9]  Jorge Almeida,et al.  Some Algorithmic Problems for Pseudovarieties , 1999 .

[10]  Luis Ribes,et al.  On The Profinite Topology on a Free Group , 1993 .

[11]  Karsten Henckell,et al.  Aperiodic Pointlikes and Beyond , 2007, Int. J. Algebra Comput..

[12]  Thomas Place,et al.  Deciding definability in FO2( , 2015, Log. Methods Comput. Sci..

[13]  Imre Simon.  Factorization Forests of Finite Height , 1990, Theor. Comput. Sci..

[14]  Kousha Etessami,et al.  First-Order Logic with Two Variables and Unary Temporal Logic , 2002, Inf. Comput..

[15]  Imre Simon,et al.  Piecewise testable events , 1975, Automata Theory and Formal Languages.

[16]  Jacques Stern,et al.  Complexity of Some Problems from the Theory of Automata , 1985, Inf. Control..

[17]  Jorge Almeida,et al.  Pointlike sets with respect to R and J , 2008 .

[18]  Paul Gastin,et al.  LTL with Past and Two-Way Very-Weak Alternating Automata , 2003, MFCS.

[19]  JORGE ALMEIDA,et al.  POINTLIKE SETS WITH RESPECT TO R AND , .

[20]  Denis Thérien,et al.  DIAMONDS ARE FOREVER: THE VARIETY DA , 2002 .

[21]  Thomas Place,et al.  Deciding Definability in FO_2(<_h, <_v) on Trees , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[22]  A. N. Trahtman,et al.  Piecewise and Local Threshold Testability of DFA , 2001 .

[23]  Harry B. Hunt,et al.  On the Decidability of Grammar Problems , 1982, JACM.

[24]  Jorge Almeida,et al.  The Pseudovariety J is Hyperdecidable , 1997, RAIRO Theor. Informatics Appl..