@InProceedings{smith:LIPIcs.FSTTCS.2013.413,
author = {Smith, Tim},
title = {{On Infinite Words Determined by Stack Automata}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
pages = {413--424},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-64-4},
ISSN = {1868-8969},
year = {2013},
volume = {24},
editor = {Seth, Anil and Vishnoi, Nisheeth K.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.413},
URN = {urn:nbn:de:0030-drops-43692},
doi = {10.4230/LIPIcs.FSTTCS.2013.413},
annote = {Keywords: stack automaton, infinite word, pumping lemma, prefix language, multihead finite automaton}
}