Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
From MaRDI portal
Publication:3540108
DOI10.1007/978-3-540-88282-4_18zbMATH Open1156.68448OpenAlexW1756618614MaRDI QIDQ3540108FDOQ3540108
Authors: Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren 
Publication date: 20 November 2008
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_18
Recommendations
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- scientific article; zbMATH DE number 1740166
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
Cited In (10)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions
- Efficient inclusion checking for deterministic tree automata and XML schemas
- Weak inclusion for XML types
- Schema-Guided Induction of Monadic Queries
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata
- Sublinear DTD validity
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Title not available (Why is that?)
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- Implementation and Application of Automata
This page was built for publication: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540108)
