The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata

@inproceedings{Colcombet2008TheNM,
  title={The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata},
  author={Thomas Colcombet and Christof L{\"o}ding},
  booktitle={ICALP},
  year={2008}
}
Given a Rabin tree-language and natural numbers i, j, the language is said to be i, j-feasible if it is accepted by a parity automaton using priorities {i, i+1, ..., j}. The i, j-feasibility induces a hierarchy over the Rabin-tree languages called the Mostowski hierarchy. In this paper we prove that the problem of deciding if a language is i, j-feasible is reducible to the uniform universality problem for distanceparity automata. Distance-parity automata form a new model of automata extending… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Arnold . The μ - calculus alternation - depth hierarchy is strict on binary trees

  • J. Duparc Arnold, F. Murlak
  • Informatique Théorique et Applications
  • 1999

The μ-calculus alternation-depth hierarchy is strict on binary trees

  • A. Arnold
  • Informatique Théorique et Applications, 33(4/5…
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…