Weak Inclusion for XML Types

DOI10.1007/978-3-642-22256-6_4zbMath1297.68105OpenAlexW161409554MaRDI QIDQ5200049

Jacques Chabin, Joshua Amavi, Mírian Halfeld Ferrari Alves, Pierre Réty

Publication date: 29 July 2011

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-22256-6_4

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Internet topics (68M11)

Related Items (1)

Weak Inclusion for XML Types

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient inclusion for a class of XML types with interleaving and counting
• The passing of a rational expression to a nondeterministic finite automaton
• Characterization of Glushkov automata
• Almost-linear inclusion for XML regular expression types
• Deciding Equivalence of Finite Tree Automata
• Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
• Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
• Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
• Ordered and Unordered Tree Inclusion
• Weak Inclusion for XML Types
• Mathematical Foundations of Computer Science 2004
• Automata, Languages and Programming
• One-unambiguous regular languages

This page was built for publication: Weak Inclusion for XML Types