Separating Regular Languages by Piecewise Testable and Unambiguous Languages
From MaRDI portal
Publication:2849957
DOI10.1007/978-3-642-40313-2_64zbMath1400.68113arXiv1304.6734OpenAlexW2124287344MaRDI QIDQ2849957
Lorijn van Rooijen, Thomas Place, Marc Zeitoun
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.6734
Related Items (20)
Reducibility of pointlike problems ⋮ The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ On Upper and Lower Bounds on the Length of Alternating Towers ⋮ Measuring power of locally testable languages ⋮ Unnamed Item ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ Unnamed Item ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ On the height of towers of subsequences and prefixes ⋮ Unnamed Item ⋮ On the index of Simon's congruence for piecewise testability ⋮ Unnamed Item ⋮ Quantifier Alternation for Infinite Words ⋮ Unnamed Item ⋮ Separating regular languages with two quantifier alternations ⋮ The Complexity of Separation for Levels in Concatenation Hierarchies ⋮ Learning algorithms ⋮ Unnamed Item ⋮ Weak Separation Problem for Tree Languages
This page was built for publication: Separating Regular Languages by Piecewise Testable and Unambiguous Languages
