Deciding Piecewise Testable Separability for Regular Tree Languages
From MaRDI portal
Publication:4598238
DOI10.4230/LIPIcs.ICALP.2016.97zbMath1388.68172OpenAlexW2275415862MaRDI QIDQ4598238
Jean Goubault-Larrecq, Sylvain Schmitz
Publication date: 19 December 2017
Full work available at URL: https://hal.inria.fr/hal-01276119
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (12)
Unnamed Item ⋮ Handling infinitely branching well-structured transition systems ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ On Arch Factorization and Subword Universality for Words and Compressed Words ⋮ Separability by piecewise testable languages is \textsc{PTime}-complete ⋮ The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings ⋮ Unboundedness Problems for Languages of Vector Addition Systems. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Forward analysis for WSTS, part I: completions ⋮ Learning algorithms ⋮ Algebra for trees
This page was built for publication: Deciding Piecewise Testable Separability for Regular Tree Languages
