Go to the corresponding LIPIcs Volume Portal 
Itsykson, Dmitry ; Okhotin, Alexander ; Oparin, Vsevolod
pdfformat: 

@InProceedings{itsykson_et_al:LIPIcs:2016:6463, author = {Dmitry Itsykson and Alexander Okhotin and Vsevolod Oparin}, title = {{Computational and Proof Complexity of Partial String Avoidability}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {51:151:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770163}, ISSN = {18688969}, year = {2016}, volume = {58}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6463}, URN = {urn:nbn:de:0030drops64637}, doi = {10.4230/LIPIcs.MFCS.2016.51}, annote = {Keywords: partial strings, partial words, avoidability, proof complexity, PSPACEcompleteness} }
Keywords:  partial strings, partial words, avoidability, proof complexity, PSPACEcompleteness  
Collection:  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  
Issue Date:  2016  
Date of publication:  19.08.2016 