Pages that link to "Item:Q389236"

The following pages link to Simplifying XML schema: single-type approximations of regular tree languages (Q389236):

Displaying 6 items.

• Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
• Optimal probabilistic generation of XML documents (Q269313) (← links)
• Deciding twig-definability of node selecting tree automata (Q269327) (← links)
• Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
• Deciding top-down determinism of regular tree languages (Q2140513) (← links)
• Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)