Efficient separability of regular languages by subsequences and suffixes

Authors:
Wojciech Czerwiński;Wim Martens;Tomáš Masopust
Affiliations:
Institute for Computer Science, University of Bayreuth, Germany;Institute for Computer Science, University of Bayreuth, Germany;Institute for Computer Science, University of Bayreuth, Germany
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 10
Cited 0

The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Piecewise testable events

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Piecewise and Local Threshold Testability of DFA

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
The complexity of reasoning about pattern-based XML schemas

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
nSPARQL: A navigational language for RDF

Web Semantics: Science, Services and Agents on the World Wide Web
Succinctness of pattern-based schema languages for XML

Journal of Computer and System Sciences
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard

Proceedings of the 21st international conference on World Wide Web
The complexity of evaluating path expressions in SPARQL

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Developing and analyzing XSDs through BonXai

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

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.