Pages that link to "Item:Q5311160"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311160):
Displayed 13 items.
- Distributed XML design (Q657904) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Efficient inclusion for a class of XML types with interleaving and counting (Q964806) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- The inclusion problem for regular expressions (Q1757837) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Active XML document rewriting based on tree automata theory (Q3446029) (← links)
- Weak Inclusion for XML Types (Q5200049) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)