×

Found 133 Documents (Results 1–100)

Deciding the topological complexity of Büchi languages. (English) Zbl 1388.68181

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 99, 13 p. (2016).
MSC:  68Q45 03D05
Full Text: DOI

On the Borel inseparability of game tree languages. (English) Zbl 1236.68170

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 565-576, electronic only (2009).

There exist some \(\omega \)-powers of any Borel rank. (English) Zbl 1179.68069

Duparc, Jacques (ed.) et al., Computer science logic. 21st international workshop, CSL 2007, 16th annual conference of the EACSL, Lausanne, Switzerland, September 11–15, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74914-1/pbk). Lecture Notes in Computer Science 4646, 115-129 (2007).
MSC:  68Q45 03E15
Full Text: DOI

Filter Results by …

Access

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Software