Fixpoints for Rabin tree automata make complementation easy
From MaRDI portal
Recommendations
Cited in
(7)- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Progress measures, immediate determinacy, and a subset construction for tree automata
- scientific article; zbMATH DE number 3960988 (Why is no real title available?)
- scientific article; zbMATH DE number 1332657 (Why is no real title available?)
- scientific article; zbMATH DE number 4189200 (Why is no real title available?)
- Top-down complementation of automata on finite trees
- An initial semantics for the -calculus on trees and Rabin's complementation lemma
This page was built for publication: Fixpoints for Rabin tree automata make complementation easy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818844)