Separating Regular Languages by Piecewise Testable and Unambiguous LanguagesReport as inadecuate




Separating Regular Languages by Piecewise Testable and Unambiguous Languages - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Abstract : 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\Sigma 1



Author: Thomas Place - Lorijn Van Rooijen - Marc Zeitoun -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents