pdfformat: 

@InProceedings{cai_et_al:LIPIcs:2011:3347, author = {Yang Cai and Ting Zhang}, title = {{A Tight Lower Bound for Streett Complementation}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {339350}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897347}, ISSN = {18688969}, year = {2011}, volume = {13}, editor = {Supratik Chakraborty and Amit Kumar}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3347}, URN = {urn:nbn:de:0030drops33474}, doi = {http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2011.339}, annote = {Keywords: omegaautomata, Streett automata, complementation, lower bounds} }
Keywords:  omegaautomata, Streett automata, complementation, lower bounds  
Seminar:  IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)  
Issue date:  2011  
Date of publication:  01.12.2011 