A note on decidable separability by piecewise testable languages
W Czerwiński, W Martens, L van Rooijen… - … on Fundamentals of …, 2015 - Springer
The separability problem for word languages of a class CC by languages of a class SS asks,
for two given languages I and E from CC, whether there exists a language S from SS that …
for two given languages I and E from CC, whether there exists a language S from SS that …
A characterization for decidable separability by piecewise testable languages
W Czerwiński, W Martens… - Discrete …, 2017 - dmtcs.episciences.org
The separability problem for word languages of a class C by languages of a class S asks, for
two given languages I and E from C, whether there exists a language S from S that includes I …
two given languages I and E from C, whether there exists a language S from S that includes I …
[PDF][PDF] A characterization for decidable separability by piecewise testable languages
W Czerwinski, W Martens, L van Rooijen… - Discrete Mathematics & …, 2017 - labri.fr
A Characterization for Decidable Separability by Piecewise Testable Languages Page 1 A
Characterization for Decidable Separability by Piecewise Testable Languages ∗ Wojciech …
Characterization for Decidable Separability by Piecewise Testable Languages ∗ Wojciech …
[PDF][PDF] An Approach of XML Query Evaluation Based Model Checking
L Yan-Mei, H Shao-Bin, L Ya, X Li - Cybernetics and Information …, 2016 - sciendo.com
In this paper, we show the process inspired by model checking which integrate temporal
logic to the application of semi-structured data query. We investigate the potential of a …
logic to the application of semi-structured data query. We investigate the potential of a …