 |
|
|
|
| HAL: inria-00192329, version 6 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| 2nd International Conference on Language and Automata Theory and Applications, Tarragona : Espagne (2008) |
|
|
| Available versions | v1 (2008-02-19) | v2 (2008-03-15) | v3 (2008-06-11) | v4 (2009-02-16) | v5 (2009-03-04) | v6 (2009-03-05) |
|
|
|
|
| Efficient Inclusion Checking for Deterministic Tree Automata and DTDs |
|
|
| Jérôme Champavère 1, 2Rémi Gilleron 1, 2 |
|
|
| (2008) |
|
|
|
| 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://static.archives-ouvertes.fr/images/mime/pdf.png |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale de Lille (LIFL) |
|
|
|
CNRS : UMR8022 – INRIA – IRCICA – Université des Sciences et Technologies de Lille - Lille I |
|
|
| 2: | MOSTRARE (INRIA Lille - Nord Europe) |
|
|
|
INRIA – CNRS : UMR8022 – Université des Sciences et Technologies de Lille - Lille I : EA3588 – Université Charles de Gaulle - Lille III |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Data Structures and Algorithms Computer Science/Web Computer Science/Computation and Language |
|
|
| tree automata – language inclusion – algorithmic complexity – XML DTD |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| inria-00192329, version 6 | |
| http://hal.inria.fr/inria-00192329 | |
| oai:hal.inria.fr:inria-00192329 | |
| From: Joachim Niehren | |
| Submitted on: Thursday, 5 March 2009 16:20:02 | |
| Updated on: Thursday, 8 September 2011 23:24:08 | |
