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, 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.

Bonizzoni, P., Mauri, G. (1992). On Automata on infinite trees. THEORETICAL COMPUTER SCIENCE, 93(2), 227-244 [10.1016/0304-3975(92)90331-9].

On Automata on infinite trees

Bonizzoni, P;Mauri, G
1992

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, 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.
Articolo in rivista - Articolo scientifico
Automata theory; infinite trees; Muller automata; Buchi automata
English
1992
93
2
227
244
none
Bonizzoni, P., Mauri, G. (1992). On Automata on infinite trees. THEORETICAL COMPUTER SCIENCE, 93(2), 227-244 [10.1016/0304-3975(92)90331-9].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/2414
Citazioni
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
Social impact