Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

DOI10.1007/978-3-540-88282-4_18zbMath1156.68448OpenAlexW1756618614MaRDI QIDQ3540108

Jérôme Champavère, Rémi Gilleron, Joachim Niehren, Aurélien Lemay

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Schema-Guided Induction of Monadic Queries ⋮ Weak Inclusion for XML Types ⋮ Efficient inclusion checking for deterministic tree automata and XML schemas

This page was built for publication: Efficient Inclusion Checking for Deterministic Tree Automata and DTDs