Go to the corresponding LIPIcs Volume Portal 
Berlinkov, Mikhail V. ; Ferens, Robert ; Szykula, Marek
pdfformat: 

@InProceedings{berlinkov_et_al:LIPIcs:2018:9614, author = {Mikhail V. Berlinkov and Robert Ferens and Marek Szykula}, title = {{Complexity of Preimage Problems for Deterministic Finite Automata}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {32:132:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9614}, URN = {urn:nbn:de:0030drops96149}, doi = {10.4230/LIPIcs.MFCS.2018.32}, annote = {Keywords: avoiding word, extending word, extensible subset, reset word, synchronizing automaton} }
Keywords:  avoiding word, extending word, extensible subset, reset word, synchronizing automaton  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 