Top-down complementation of automata on finite trees

DOI10.1016/J.IPL.2024.106499MaRDI QIDQ6602316

Laurent Doyen

Publication date: 11 September 2024

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

game theorycomplementationtree automatatree languages

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45)

Cites Work

• Partial orders on words, minimal elements of regular languages, and state complexity
• Automata on finite trees
• Tree acceptors and some of their applications
• Nondeterminism and the size of two way finite automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Checking in polynomial time whether or not a regular tree language is deterministic top-down
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Top-down complementation of automata on finite trees

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