Separating Regular Languages by Piecewise Testable and Unambiguous LanguagesReportar como inadecuado




Separating Regular Languages by Piecewise Testable and Unambiguous Languages - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* 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



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

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



DESCARGAR PDF




Documentos relacionados