. "978-3-642-39211-5" . . . "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."@en . "regular languages; separation; piecewise testable languages"@en . . . "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." . "3"^^ . . "10.1007/978-3-642-39212-2_16" . "112"^^ . . "1"^^ . . "I" . "Efficient separability of regular languages by subsequences and suffixes" . "Automata, Languages, and Programming. Part II" . . . "Efficient separability of regular languages by subsequences and suffixes"@en . "Efficient separability of regular languages by subsequences and suffixes"@en . "2013-07-08+02:00"^^ . . "RIV/67985840:_____/13:00394007" . "Martens, W." . . "72090" . . "Czerwi\u0144ski, W." . "Riga" . "Springer-Verlag" . . "RIV/67985840:_____/13:00394007!RIV14-AV0-67985840" . . . "Efficient separability of regular languages by subsequences and suffixes" . "[8C6E5789AC60]" . "Masopust, Tom\u00E1\u0161" . "Berlin" .