Go to the corresponding LIPIcs Volume Portal |
Daviaud, Laure ; Jurdzinski, Marcin ; Lehtinen, Karoliina
pdf-format: |
|
@InProceedings{daviaud_et_al:LIPIcs:2019:10920, author = {Laure Daviaud and Marcin Jurdzinski and Karoliina Lehtinen}, title = {{Alternating Weak Automata from Universal Trees}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Wan Fokkink and Rob van Glabbeek}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10920}, URN = {urn:nbn:de:0030-drops-109208}, doi = {10.4230/LIPIcs.CONCUR.2019.18}, annote = {Keywords: alternating automata, weak automata, B{\"u}chi automata, parity automata, parity games, universal trees} }
Keywords: | alternating automata, weak automata, Büchi automata, parity automata, parity games, universal trees | |
Collection: | 30th International Conference on Concurrency Theory (CONCUR 2019) | |
Issue Date: | 2019 | |
Date of publication: | 20.08.2019 |