Deciding Nondeterministic Hierarchy of Deterministic Tree AutomataReport as inadecuate




Deciding Nondeterministic Hierarchy of Deterministic Tree Automata - Download this document for free, or read online. Document in PDF available to download.

1 Institute of Informatics, Warsaw University 2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Abstract : 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.





Author: Damian Niwinski - Igor Walukiewicz -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents