Deciding Nondeterministic Hierarchy of Deterministic Tree Automata

We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urbański on deciding if a given deterministic Rabin automaton is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic notes in theoretical computer science Ročník 123; s. 195 - 208
Hlavní autoři: Niwiński, Damian, Walukiewicz, Igor
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.03.2005
Elsevier
Témata:
Computer Science
decidability
Logic in Computer Science
Mostowski index
Parity tree automata
Mostowski index
decidability
Parity tree automata
ISSN:1571-0661, 1571-0661
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urbański on deciding if a given deterministic Rabin automaton is equivalent to a nondeterministic Büchi automaton. The algorithm runs in the time of verifying the non-emptiness of nondeterministic parity automata.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2004.05.015