On languages piecewise testable in the strict sense
From MaRDI portal
Publication:3585010
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
(17)- Deterministic top-down tree automata with Boolean deterministic look-ahead
- Testing Simon's congruence
- On the index of Simon's congruence for piecewise testability
- Separability by piecewise testable languages is \textsc{PTime}-complete
- On Boolean combinations forming piecewise testable languages
- Separability by piecewise testable languages and downward closures beyond subwords
- Linear size test sets for certain commutative languages
- Robust identification in the limit from incomplete positive data
- Handling infinitely branching well-structured transition systems
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- The expressivity of autosegmental grammars
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- A Note on Decidable Separability by Piecewise Testable Languages
- Relativized adjacency
- Learning in the limit with lattice-structured hypothesis spaces
- An Algebraic Characterization of Strictly Piecewise Languages
- Structure sensitive tier projection: applications and formal properties
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)
