Pages that link to "Item:Q882435"
From MaRDI portal
The following pages link to On the minimization of XML schemas and tree automata for unranked trees (Q882435):
Displaying 22 items.
- Optimal probabilistic generation of XML documents (Q269313) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Simplifying XML schema: single-type approximations of regular tree languages (Q389236) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Efficient inclusion testing for simple classes of unambiguous \(\omega \)-automata (Q436610) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Distributed XML design (Q657904) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Learning algorithms (Q2074213) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
- From Tree Automata to Rational Tree Expressions (Q4963267) (← links)
- Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata (Q5042238) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- (Q5216306) (← links)
- Database Theory - ICDT 2005 (Q5316616) (← links)
- Rewriting Techniques and Applications (Q5901564) (← links)
