Alternative automata characterization of piecewise testable languages
From MaRDI portal
Publication:5300848
DOI10.1007/978-3-642-38771-5_26zbMATH Open1381.68123OpenAlexW2285315733MaRDI QIDQ5300848FDOQ5300848
Authors: Ondřej Klíma, Libor Polák 
Publication date: 28 June 2013
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_26
Recommendations
Cited In (18)
- Testing Simon's congruence
- 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
- On languages piecewise testable in the strict sense
- Biautomata for \(k\)-piecewise testable languages
- Obituary: Libor Polák (1950--2020)
- On the index of Simon's congruence for piecewise testability
- On Boolean combinations forming piecewise testable languages
- Complexity of universality and related problems for partially ordered NFAs
- On the Simon's congruence neighborhood of languages
- Characterizations of some classes of regular events
- Title not available (Why is that?)
- Title not available (Why is that?)
- Piecewise testable languages via combinatorics on words
- Learning from positive and negative examples: dichotomies and parameterized algorithms
- Separability by piecewise testable languages is \textsc{PTime}-complete
- On the complexity of \(k\)-piecewise testability and the depth of automata
- Piecewise testable languages and nondeterministic automata
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)
