On Languages Piecewise Testable in the Strict Sense
From MaRDI portal
Publication:3585010
DOI10.1007/978-3-642-14322-9_19zbMath1286.68457MaRDI QIDQ3585010
No author found.
Publication date: 31 August 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14322-9_19
Related Items
Unnamed Item, Relativized adjacency, The expressivity of autosegmental grammars, Learning in the limit with lattice-structured hypothesis spaces, On the state complexity of closures and interiors of regular languages with subwords and superwords, Handling infinitely branching well-structured transition systems, Separability by piecewise testable languages is \textsc{PTime}-complete, Deterministic top-down tree automata with Boolean deterministic look-ahead, On the index of Simon's congruence for piecewise testability, An Algebraic Characterization of Strictly Piecewise Languages