pdfformat: 

@InProceedings{gawrychowski_et_al:LIPIcs:2020:11877, author = {Paweł Gawrychowski and Martin Lange and Narad Rampersad and Jeffrey Shallit and Marek Szykuła}, title = {{Existential Length Universality}}, booktitle = {37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, pages = {16:116:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771405}, ISSN = {18688969}, year = {2020}, volume = {154}, editor = {Christophe Paul and Markus Bl{\"a}ser}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11877}, URN = {urn:nbn:de:0030drops118770}, doi = {10.4230/LIPIcs.STACS.2020.16}, annote = {Keywords: decision problem, deterministic automaton, nondeterministic automaton, pushdown automaton, regular expression, regular language, universality} }
Keywords:  decision problem, deterministic automaton, nondeterministic automaton, pushdown automaton, regular expression, regular language, universality  
Seminar:  37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)  
Issue date:  2020  
Date of publication:  04.03.2020 