Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

@inproceedings{Champavre2008EfficientIC,
  title={Efficient Inclusion Checking for Deterministic Tree Automata and DTDs},
  author={J{\'e}r{\^o}me Champav{\`e}re and R{\'e}mi Gilleron and Aur{\'e}lien Lemay and Joachim Niehren},
  booktitle={LATA},
  year={2008}
}
We present a new algorithm for testing language inclusion L(A) ⊆ L(B) between tree automata in time O(|A| ∗ |B|) where B is deterministic. We extend this algorithm for testing inclusion between automata for unranked trees A and deterministic DTDsD in time O(|A|∗ |Σ| ∗ |D|). No previous algorithms with these complexities exist. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Martens and Joachim Niehren . On the minimization of XML schemas and tree automata for unranked trees

  • D. Suciu, V. Vianu
  • J . of Comp . and Sys . Sci
  • 2007

Similar Papers

Loading similar papers…