Document Open Access Logo

On the separation question for tree languages

Authors André Arnold, Henryk Michalewski, Damian Niwinski

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2012.396.pdf
  • Filesize: 0.65 MB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Alternating automata on infinite trees
  • Index hierarchy
  • Separation property

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We show that the separation property fails for  the classes Sigma_n of the Rabin-Mostowski index hierarchy of alternating automata on infinite trees. This extends  our previous result (obtained with Szczepan Hummel) on the failure of the separation property for the class Sigma_2 (i.e., for  co-Buchi sets). It remains open whether the separation property does hold for the classes Pi_n of the index hierarchy. To prove our result, we first consider the Rabin-Mostowski index hierarchy of deterministic automata on  infinite words, for which we give a complete answer (generalizing previous results of Selivanov): the separation property holds for Pi_n and fails for Sigma_n-classes. The construction invented for words turns out to be useful for trees via a suitable game.

Cite As Get BibTex

André Arnold, Henryk Michalewski, and Damian Niwinski. On the separation question for tree languages. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 396-407, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.STACS.2012.396

Author Details

André Arnold
Henryk Michalewski
Damian Niwinski
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact