Publication:5738937
From MaRDI portal
DOI10.4230/LIPIcs.ICDT.2015.230zbMath1365.68206MaRDI QIDQ5738937
Publication date: 13 June 2017
68Q25: Analysis of algorithms and problem complexity
68P15: Database theory
68R15: Combinatorics on words
68Q45: Formal languages and automata
Related Items
Unnamed Item, Separability by piecewise testable languages is \textsc{PTime}-complete, Complexity of universality and related problems for partially ordered NFAs, On Boolean combinations forming piecewise testable languages, A Note on Decidable Separability by Piecewise Testable Languages, On the Complexity of k-Piecewise Testability and the Depth of Automata