On the Boolean Closure of Deterministic Top-Down Tree Automata

DOI10.1142/S0129054123480015arXiv2401.06596MaRDI QIDQ6154972

Wolfgang Thomas, Christof Löding

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

MSO logicregular tree languagestop-down tree automata

Mathematics Subject Classification ID

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

Cites Work

• Deciding top-down determinism of regular tree languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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