×

Found 14 Documents (Results 1–14)

On the way to alternating weak automata. (English) Zbl 1528.68176

Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 21, 22 p. (2018).
MSC:  68Q45
Full Text: DOI

Unambiguous languages exhaust the index hierarchy. (English) Zbl 1499.68195

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 140, 14 p. (2018).
MSC:  68Q45

Linear game automata: decidable hierarchy problems for stripped-down alternating tree automata. (English) Zbl 1257.03063

Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7–11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 225-239 (2009).
MSC:  03D05 03B25 03D55

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field

Software