September 29, 2023 article Open access Checking in polynomial time whether or not a regular tree language is deterministic top-down Information Processing Letters DOI: 10.1016/j.ipl.2023.106449 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 4 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access On the Boolean Closure of Deterministic Top-Down Tree Automata 2023 International Journal of Foundations of Computer Science article Computer Science semigroups and automata theory Open access 0 citations 1 result References 0