Projection for Büchi Tree Automata with Constraints between Siblings

DOI10.1142/S012905412041004XzbMath1477.68155OpenAlexW3092431169MaRDI QIDQ5859646

Patrick Landwehr, Christof Löding

Publication date: 19 April 2021

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

Full work available at URL: https://doi.org/10.1142/s012905412041004x

zbMATH Keywords

equality constraintsprojectioninequality constraintstree automatainfinite treesemptinessrelabelingsibling constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Uses Software

• MONA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic tree automata
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Alternating finite automata on \(\omega\)-words
• Projection for Büchi tree automata with constraints between siblings
• The HOM problem is decidable
• TREE AUTOMATA WITH GLOBAL CONSTRAINTS
• Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings
• Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
• Equality and disequality constraints on direct subterms in tree automata
• Tree Automata over Infinite Alphabets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees