Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
We study that version of the ground tree transducer game where the same tree automaton appears as the first and second component of the associated ground tree transducer. We give conditions which imply that Beta has a winning strategy. Furthermore, we show the following decidability result. Given a ground tree transducer game where the underlying tree automaton A cannot evaluate some tree into a state or A is deterministic, we can decide which player has a winning strategy. Moreover, whatever player has a winning strategy, we can effectively construct a partial recursive winning strategy for him.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
157--172
Opis fizyczny
bibliogr. 18 poz.
Twórcy
autor
autor
- Department of Applied Informatics University of Szeged Szeged, Arpad tér 2, H-6720 Hungary, apro@inf.u-szeged.hu
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0009-0068