On languages piecewise testable in the strict sense
From MaRDI portal
Publication:3585010
DOI10.1007/978-3-642-14322-9_19zbMATH Open1286.68457OpenAlexW1662195770MaRDI QIDQ3585010FDOQ3585010
Authors:
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
Recommendations
- An Algebraic Characterization of Strictly Piecewise Languages
- On the word problem for syntactic monoids of piecewise testable languages.
- Alternative automata characterization of piecewise testable languages
- Piecewise testable languages via combinatorics on words
- Separability by piecewise testable languages is \textsc{PTime}-complete
Cited In (16)
- A Note on Decidable Separability by Piecewise Testable Languages
- Learning in the limit with lattice-structured hypothesis spaces
- On the index of Simon's congruence for piecewise testability
- On Boolean combinations forming piecewise testable languages
- Linear size test sets for certain commutative languages
- Relativized adjacency
- An Algebraic Characterization of Strictly Piecewise Languages
- Separability by piecewise testable languages and downward closures beyond subwords
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- The expressivity of autosegmental grammars
- Robust identification in the limit from incomplete positive data
- On the state complexity of closures and interiors of regular languages with subwords and superwords
This page was built for publication: On languages piecewise testable in the strict sense
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585010)
