Abstract
One of the main difficulties when working with regular languages of infinite trees is the lack of a convenient notion of recognition. In particular, since deterministic automata are too weak, one has to deal with an inherent non-determinism. On the other hand, many problems simplify when we restrict to languages recognisable by deterministic automata (called deterministic languages), see Sect. 1.7.6 on page 26. The crucial technique standing behind these results is the so-called pattern method — the properties of a deterministic language are reflected by certain patterns in the graph of a deterministic automaton recognising it.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
If \(\mathrm{L}({\mathcal {B}})\notin \mathbf {Comp}(\varvec{\Pi }^{\mathrm {alt}}_{0}) \) then for all n the answer is no.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Skrzypczak, M. (2016). Index Problems for Game Automata. In: Descriptive Set Theoretic Methods in Automata Theory. Lecture Notes in Computer Science(), vol 9802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-52947-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-52947-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-52946-1
Online ISBN: 978-3-662-52947-8
eBook Packages: Computer ScienceComputer Science (R0)