TL;DR
This paper introduces a class of algebraic structures called branch-continuous tree algebras, designed to recognize regular languages of infinite trees, advancing the theoretical understanding of automata on infinite structures.
Contribution
It defines and analyzes branch-continuous tree algebras, providing a new algebraic framework for recognizing regular infinite tree languages.
Findings
Established properties of branch-continuous tree algebras.
Connected these algebras to automata theory for infinite trees.
Provided foundational results for future research in tree automata.
Abstract
We study a class of algebras that can be used as recognisers for regular languages of infinite trees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.