Checking in polynomial time whether or not a regular tree language is deterministic top-down

Sebastian Maneth, Helmut Seidl. Checking in polynomial time whether or not a regular tree language is deterministic top-down. Inf. Process. Lett., 184:106449, February 2024. [doi]

Abstract

Abstract is missing.