Deciding Nondeterministic Hierarchy of Deterministic Tree Automata

Damian Niwinski (1) , Igor Walukiewicz (2)

1 Institute of Informatics [Warsaw]
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski index of a nondeterministic automaton recognizing the same language.

Domaines: Logique en informatique [cs.LO]

Damian Niwinski, Igor Walukiewicz. Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electronic Notes in Theoretical Computer Science, 2005, 123, pp.195-208. ⟨hal-00353557⟩