Go to the corresponding LIPIcs Volume Portal 
Gruber, Hermann ; Holzer, Markus
pdfformat: 

@InProceedings{gruber_et_al:LIPIcs.MFCS.2021.52, author = {Gruber, Hermann and Holzer, Markus}, title = {{Optimal Regular Expressions for Palindromes of Given Length}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {52:152:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772013}, ISSN = {18688969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14492}, URN = {urn:nbn:de:0030drops144921}, doi = {10.4230/LIPIcs.MFCS.2021.52}, annote = {Keywords: regular expression, descriptional complexity, lower bound, upper bound, recurrence, sum of digits} }
Keywords:  regular expression, descriptional complexity, lower bound, upper bound, recurrence, sum of digits  
Collection:  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)  
Issue Date:  2021  
Date of publication:  18.08.2021 