Separating regular languages by piecewise testable and unambiguous languages

@inproceedings{Place2013SeparatingRL,
  title={Separating regular languages by piecewise testable and unambiguous languages},
  author={Thomas Place and Lorijn van Rooijen and Marc Zeitoun},
  booktitle={MFCS},
  year={2013}
}
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 BΣ1(<) sentence can witness that the languages are disjoint. The proof refines an algebraic argument from Almeida and the third author. When separation… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 4 times. VIEW TWEETS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Diamonds are forever : The variety DA

D. Thérien, T. Wilke
Semigroups , Algorithms , Automata and Languages , pages 475 – 500 . World Scientific • 2002

Diamonds are forever: The variety DA. In Semigroups, Algorithms, Automata and Languages, pages 475–500

P. Tesson, D. Therien
World Scientific, • 2002
View 2 Excerpts

Similar Papers

Loading similar papers…