Pages that link to "Item:Q5492917"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5492917):
Displayed 9 items.
- Which XML schemas are streaming bounded repairable? (Q269345) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Deciding top-down determinism of regular tree languages (Q2140513) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- An Automata Theoretic Approach to Rational Tree Relations (Q5448669) (← links)
- Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)