Weak inclusion for XML types
From MaRDI portal
Recommendations
Cites work
- Almost-linear inclusion for XML regular expression types
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Automata, Languages and Programming
- Characterization of Glushkov automata
- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees
- Deciding Equivalence of Finite Tree Automata
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs
- Efficient inclusion for a class of XML types with interleaving and counting
- scientific article; zbMATH DE number 1951144 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- One-unambiguous regular languages
- Ordered and Unordered Tree Inclusion
- The passing of a rational expression to a nondeterministic finite automaton
- Weak inclusion for XML types
Cited in
(5)
This page was built for publication: Weak inclusion for XML types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200049)