Weak inclusion for recursive XML types

DOI10.1007/978-3-642-31606-7_7MaRDI QIDQ2914696zbMATH OpenOpenAlexFDO

Authors Joshua Amavi, Jacques Chabin, Pierre Réty

Publication date 20 September 2012

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31606-7_7

zbMATH Keywords

approximative inclusionregular unranked-tree grammarXML type

Mathematics Subject Classification ID

Internet topics (68M11) Database theory (68P15) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Weak inclusion for XML types
• Efficient inclusion for a class of XML types with interleaving and counting
• Efficient inclusion checking for deterministic tree automata and XML schemas
• Almost-linear inclusion for XML regular expression types
• Regular expression types for XML

Cited in

(3)

• scientific article; zbMATH DE number 2080481 (Why is no real title available?)
• Weak inclusion for XML types
• Efficient inclusion for a class of XML types with interleaving and counting

This page was built for publication: Weak inclusion for recursive XML types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914696)