Pages that link to "Item:Q2140513"

The following pages link to Deciding top-down determinism of regular tree languages (Q2140513):

Displaying 2 items.

• Checking in polynomial time whether or not a regular tree language is deterministic top-down (Q6121430) (← links)
• On the Boolean Closure of Deterministic Top-Down Tree Automata (Q6154972) (← links)