Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (Q3540108)
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 DTDs |
scientific article; zbMATH DE number 5369311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Inclusion Checking for Deterministic Tree Automata and DTDs |
scientific article; zbMATH DE number 5369311 |
Statements
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (English)
0 references
20 November 2008
0 references
0.9676270484924316
0 references
0.8059960007667542
0 references
0.783662736415863
0 references
0.7682339549064636
0 references
