@InProceedings{kuperberg_et_al:LIPIcs.FSTTCS.2011.66,
author = {Kuperberg, Denis and Vanden Boom, Michael},
title = {{Quasi-Weak Cost Automata: A New Variant of Weakness}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {66--77},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.66},
URN = {urn:nbn:de:0030-drops-33517},
doi = {10.4230/LIPIcs.FSTTCS.2011.66},
annote = {Keywords: Automata, infinite trees, cost functions, weak}
}