@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2013.562,
author = {Bojanczyk, Mikolaj and Idziaszek, Tomasz and Skrzypczak, Michal},
title = {{Regular languages of thin trees}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {562--573},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Portier, Natacha and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.562},
URN = {urn:nbn:de:0030-drops-39655},
doi = {10.4230/LIPIcs.STACS.2013.562},
annote = {Keywords: infinite trees, regular languages, effective characterizations, topological complexity}
}