Efficient Separability of Regular Languages by Subsequences and Suffixes
Formal Languages and Automata Theory
2013-03-06 v1
Abstract
When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.
Cite
@article{arxiv.1303.0966,
title = {Efficient Separability of Regular Languages by Subsequences and Suffixes},
author = {Wojciech Czerwiński and Wim Martens and Tomáš Masopust},
journal= {arXiv preprint arXiv:1303.0966},
year = {2013}
}