{Aperiodicity of Rational Functions Is PSPACE-Complete}
@inproceedings{FGL16, address = {Dagstuhl, Germany}, author = {Filiot, Emmanuel and Gauwin, Olivier and Lhote, Nathan}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, doi = {10.4230/LIPIcs.FSTTCS.2016.13}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, isbn = {978-3-95977-027-9}, issn = {1868-8969}, pages = {13:1--13:15}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, sha256 = {2896E18ABB7F08A4988E82131FA797DEB8452349675ADE2747C292C1793D360D}, title = {{Aperiodicity of Rational Functions Is PSPACE-Complete}}, url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.13}, urn = {urn:nbn:de:0030-drops-68482}, volume = {65}, year = {2016} }