Abstract
In the paper first of all we analyze new conditions for acceptance of sets of infinite trees recognized by Muller automata and for which equivalent Büchi automata can be given. We define a new model of infinite tree automata, called limited Muller automata, and investigate their characterization in weak monadic logic. In the second part we extend the notion of control automaton to the case where more than one language is used to control the set of infinite words labeling each path of a successful run on a tree. We prove that using boolean operators in defining acceptance conditions for control automata, a characterization in terms of control automata for M-automata, introduced by Nivat and Saoudi (1988), and other classes of automata can be given. We introduce the And-control automaton and use this notion to prove properties of boolean closure of deterministic classes of automata.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
