HAL - INRIA :: [inria-00192329, version 6] Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

inria-00192329, version 6

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

Jérôme Champavère () ^1, 2, Rémi Gilleron ^1, 2, Aurélien Lemay ^1, 2, Joachim Niehren () ^1, 2

2nd International Conference on Language and Automata Theory and Applications 5196 (2008) 184-195

Résumé : We present a new algorithm for testing language inclusion L(A) ⊆ L(B)L(A) 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 DTDs D in time O(|A| |Σ| |D|). No previous algorithms with these complexities exist.

A journal extension is available at http://hal.inria.fr/inria-00366082 .

1 : Laboratoire d'Informatique Fondamentale de Lille (LIFL)
CNRS : UMR8022 – INRIA – IRCICA – Université Lille 1 - Sciences et Technologies
2 : MOSTRARE (INRIA Lille - Nord Europe)
INRIA – CNRS : UMR8022 – Université Lille 1 - Sciences et Technologies : EA3588 – Université Charles de Gaulle - Lille III

inria-00192329, version 6
http://hal.inria.fr/inria-00192329
oai:hal.inria.fr:inria-00192329
Contributeur : Joachim Niehren <>
Soumis le : Jeudi 5 Mars 2009, 16:20:02
Dernière modification le : Lundi 19 Mars 2012, 21:13:30

Voir la fiche détaillée

Documents associés

PDF :

Annexes :

Exporter

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="inproceedings"><head>Communications avec actes</head>
<biblStruct type="inproceedings" xml:id="inria-00192329"><analytic>
<author><persName><forename>Jérôme</forename><surname>Champavère</surname></persName>
<affiliation>
<orgName type="laboratory">LIFL</orgName>
<orgName type="team">Laboratoire d'Informatique Fondamentale de Lille</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">IRCICA</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies</orgName>
</affiliation>
<affiliation>
<orgName type="laboratory">INRIA Lille - Nord Europe</orgName>
<orgName type="team">MOSTRARE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies : EA3588</orgName>
<orgName type="institution">Université Charles de Gaulle - Lille III</orgName>
</affiliation>
</author>
<author><persName><forename>Rémi</forename><surname>Gilleron</surname></persName>
<affiliation>
<orgName type="laboratory">LIFL</orgName>
<orgName type="team">Laboratoire d'Informatique Fondamentale de Lille</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">IRCICA</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies</orgName>
</affiliation>
<affiliation>
<orgName type="laboratory">INRIA Lille - Nord Europe</orgName>
<orgName type="team">MOSTRARE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies : EA3588</orgName>
<orgName type="institution">Université Charles de Gaulle - Lille III</orgName>
</affiliation>
</author>
<author><persName><forename>Aurélien</forename><surname>Lemay</surname></persName>
<affiliation>
<orgName type="laboratory">LIFL</orgName>
<orgName type="team">Laboratoire d'Informatique Fondamentale de Lille</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">IRCICA</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies</orgName>
</affiliation>
<affiliation>
<orgName type="laboratory">INRIA Lille - Nord Europe</orgName>
<orgName type="team">MOSTRARE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies : EA3588</orgName>
<orgName type="institution">Université Charles de Gaulle - Lille III</orgName>
</affiliation>
</author>
<author><persName><forename>Joachim</forename><surname>Niehren</surname></persName>
<affiliation>
<orgName type="laboratory">LIFL</orgName>
<orgName type="team">Laboratoire d'Informatique Fondamentale de Lille</orgName>
<country>FR</country>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">IRCICA</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies</orgName>
</affiliation>
<affiliation>
<orgName type="laboratory">INRIA Lille - Nord Europe</orgName>
<orgName type="team">MOSTRARE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
<orgName type="institution">CNRS : UMR8022</orgName>
<orgName type="institution">Université Lille 1 - Sciences et Technologies : EA3588</orgName>
<orgName type="institution">Université Charles de Gaulle - Lille III</orgName>
</affiliation>
</author>
<title type="main" level="a">Efficient Inclusion Checking for Deterministic Tree Automata and DTDs</title></analytic><monogr><meeting>2nd International Conference on Language and Automata Theory and Applications</meeting><imprint><publisher>Springer</publisher><pubPlace><settlement>Tarragona</settlement><country>Espagne</country></pubPlace><biblScope type="publicationDate">2008-00-00</biblScope><biblScope type="vol">5196</biblScope><biblScope type="pp">184-195</biblScope></imprint></monogr><idno type="HALid">http://hal.inria.fr/inria-00192329</idno><idno type="HALFile">http://hal.inria.fr/inria-00192329/PDF/lata08_paper.pdf</idno></biblStruct>
</listBibl>
</listBibl>