@inproceedings{KuperbergVandenBoom:FSTTCS:2011,
Address = {Dagstuhl, Germany},
Annote = {Keywords: Automata, infinite trees, cost functions, weak},
Author = {Kuperberg, Denis and Boom, Michael Vanden},
BookTitle = {Proc. of FSTTCS 2011},
Editor = {Chakraborty, Supratik and Kumar, Amit},
File = {FSTTCS11slides (0) - a - a - e.pdf},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
Pages = {66--77},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{Quasi-Weak Cost Automata: A New Variant of Weakness }},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3351},
Volume = {13},
Year = {2011},
bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2011/3351},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.66},
date-added = {2018-10-30 15:01:03 +0000},
date-modified = {2020-08-04 11:33:27 +0200},
file-2 = {Quasi-Weak Cost Automata- A New Variant of Weakness - 33 - a - a - e.pdf},
urn = {urn:nbn:de:0030-drops-33517},
doi = {10.4230/LIPIcs.FSTTCS.2011.66}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A