On the Boolean Closure of Deterministic Top-Down Tree Automata

DOI10.1142/S0129054123480015MaRDI QIDQ6154972zbMATH OpenFDO

Authors Christof Löding, Wolfgang Thomas

Publication date 16 February 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2401.06596

zbMATH Keywords

regular tree languagesMSO logictop-down tree automata

Mathematics Subject Classification ID

Theory of computing (68Qxx) Computability and recursion theory (03Dxx) General logic (03Bxx)

Cites work

• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3711381 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 480524 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Deciding top-down determinism of regular tree languages

This page was built for publication: On the Boolean Closure of Deterministic Top-Down Tree Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154972)