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]
@article{ManethS24,
title = {Checking in polynomial time whether or not a regular tree language is deterministic top-down},
author = {Sebastian Maneth and Helmut Seidl},
year = {2024},
month = {February},
doi = {10.1016/j.ipl.2023.106449},
url = {https://doi.org/10.1016/j.ipl.2023.106449},
researchr = {https://researchr.org/publication/ManethS24},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {184},
pages = {106449},
}