Deciding piecewise testable separability for regular tree languages
From MaRDI portal
Recommendations
- A characterization for decidable separability by piecewise testable languages
- A Note on Decidable Separability by Piecewise Testable Languages
- Separability by piecewise testable languages is \textsc{PTime}-complete
- Separability by piecewise testable languages and downward closures beyond subwords
- Separating regular languages by piecewise testable and unambiguous languages
Cited in
(23)- Handling infinitely branching well-structured transition systems
- Separability by piecewise testable languages is \textsc{PTime}-complete
- Learning algorithms
- Algebra for trees
- Property testing of regular tree languages
- A Note on Decidable Separability by Piecewise Testable Languages
- A decidable characterization of locally testable tree languages
- The ideal approach to computing closed subsets in well-quasi-orderings
- Forward analysis for WSTS, part I: completions
- A characterization for decidable separability by piecewise testable languages
- Regular separability of one counter automata
- Unboundedness problems for languages of vector addition systems
- Intersection types for unboundedness problems
- Separability by piecewise testable languages and downward closures beyond subwords
- scientific article; zbMATH DE number 7056230 (Why is no real title available?)
- Cost Automata, Safe Schemes, and Downward Closures
- On Arch Factorization and Subword Universality for Words and Compressed Words
- Timed games and deterministic separability
- Cost automata, safe schemes, and downward closures
- Directed regular and context-free languages
- Regular separators for VASS coverability languages
- Verifying unboundedness via amalgamation
- On the piecewise complexity of words
This page was built for publication: Deciding piecewise testable separability for regular tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598238)
