Alternative automata characterization of piecewise testable languages
From MaRDI portal
Recommendations
Cited in
(19)- Characterizations of some classes of regular events
- Separability by piecewise testable languages is \textsc{PTime}-complete
- On shuffle products, acyclic automata and piecewise-testable languages
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- Complexity of universality and related problems for partially ordered NFAs
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- On Boolean combinations forming piecewise testable languages
- On the index of Simon's congruence for piecewise testability
- Obituary: Libor Polák (1950--2020)
- Biautomata for k-piecewise testable languages
- On the complexity of k-piecewise testability and the depth of automata
- On languages piecewise testable in the strict sense
- Piecewise testable languages and nondeterministic automata
- Partially ordered automata and piecewise testability
- Testing Simon's congruence
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- On the Simon's congruence neighborhood of languages
- Piecewise testable languages via combinatorics on words
- Operational complexity in subregular classes
This page was built for publication: Alternative automata characterization of piecewise testable languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300848)
