Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient inclusion checking for deterministic tree automata and XML schemas |
scientific article; zbMATH DE number 5639683
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient inclusion checking for deterministic tree automata and XML schemas |
scientific article; zbMATH DE number 5639683 |
Statements
Efficient inclusion checking for deterministic tree automata and XML schemas (English)
0 references
27 November 2009
0 references
tree automata
0 references
language inclusion
0 references
algorithmic complexity
0 references
XML shemas
0 references
0 references
0 references
0.96292555
0 references
0.9314954
0 references
0.8561401
0 references
0.8497361
0 references
0.8492163
0 references
