On the Boolean Closure of Deterministic Top-Down Tree Automata

DOI10.1142/S0129054123480015arXiv2401.06596MaRDI QIDQ6154972FDOQ6154972

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Title not available (Why is that?)
• Deciding top-down determinism of regular tree languages
• Title not available (Why is that?)
• Title not available (Why is that?)

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)