List of publications

@article{RADA2024125571,
  title = {Periodicity of general multidimensional continued fractions using repetend matrix form},
  journal = {Expositiones Mathematicae},
  volume = {42},
  number = {3},
  pages = {125571},
  year = {2024},
  issn = {0723-0869},
  doi = {10.1016/j.exmath.2024.125571},
  author = {Řada, Hanka and Starosta, Štěpán and Kala, Vítězslav},
  keywords = {Multidimensional continued fraction, Repetend matrix form, Algebraic Jacobi–Perron algorithm, Periodic expansion}
}

@article{KLOUDA2024105904,
  title = {The number of primitive words of unbounded exponent in the language of an {HD0L}-system is finite},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {206},
  pages = {105904},
  year = {2024},
  issn = {0097-3165},
  doi = {10.1016/j.jcta.2024.105904},
  author = {Klouda, Karel and Starosta, Štěpán},
  keywords = {HD0L-system, Unbounded exponent, Infinite repetition, Formal proof}
}

@misc{starosta2023infinite,
  title = {Infinite Words and Morphic Languages Formalized in {I}sabelle/{HOL}},
  author = {Starosta, Štěpán},
  year = {2023},
  note = {preprint},
  doi = {10.48550/arXiv.2303.11445}
}

@article{faithful,
  title = {On a faithful representation of Sturmian morphisms},
  journal = {Eur. J. Combin.},
  volume = {110},
  pages = {103707},
  year = {2023},
  issn = {0195-6698},
  doi = {10.1016/j.ejc.2023.103707},
  url = {https://www.sciencedirect.com/science/article/pii/S0195669823000240},
  author = {Lepšová, Jana and Pelantová, Edita and {\v{S}}t\v{e}p\'an Starosta}
}

@article{Two_Generated_Word_Monoids_Intersection-AFP,
  author = {Holub, Štěpán and Starosta, Štěpán},
  title = {Intersection of two monoids generated by two element codes},
  journal = {Archive of Formal Proofs},
  month = jan,
  year = {2023},
  url = {https://isa-afp.org/entries/Two_Generated_Word_Monoids_Intersection.html},
  issn = {2150-914x}
}

@article{HoRaSta23,
  author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Ra{\v{s}}ka, Martin and Starosta, {\v{S}}t{\v{e}}p{\'a}n},
  title = {Binary Codes that do not Preserve Primitivity},
  journal = {J. Automat. Reason.},
  year = {2023},
  month = jul,
  day = {18},
  volume = {67},
  number = {3},
  pages = {25},
  issn = {1573-0670},
  doi = {10.1007/s10817-023-09674-2}
}

@inproceedings{IJCAR,
  author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Ra{\v{s}}ka, Martin and Starosta, {\v{S}}t{\v{e}}p{\'a}n},
  editor = {Blanchette, Jasmin and Kov{\'a}cs, Laura and Pattinson, Dirk},
  title = {Binary Codes that Do Not Preserve Primitivity},
  booktitle = {Automated Reasoning},
  year = {2022},
  publisher = {Springer International Publishing},
  address = {Cham},
  pages = {369--387},
  url = {https://link.springer.com/chapter/10.1007/978-3-031-10769-6_23}
}

@inproceedings{itp2021,
  author = {Holub, {\v{S}}t{\v{e}}p\'{a}n and Starosta, {\v{S}}t{\v{e}}p\'{a}n},
  title = {{Formalization of Basic Combinatorics on Words}},
  booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)},
  pages = {22:1--22:17},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  isbn = {978-3-95977-188-7},
  issn = {1868-8969},
  year = {2021},
  volume = {193},
  editor = {Cohen, Liron and Kaliszyk, Cezary},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address = {Dagstuhl, Germany},
  url = {https://drops.dagstuhl.de/opus/volltexte/2021/13917},
  urn = {urn:nbn:de:0030-drops-139177},
  doi = {10.4230/LIPIcs.ITP.2021.22},
  annote = {Keywords: combinatorics on words, formalization, Isabelle/HOL}
}

@inproceedings{10.1007/978-3-030-81508-0_18,
  author = {Holub, \v{S}t\v{e}p\'{a}n and Starosta, \v{S}t\v{e}p\'{a}n},
  title = {Lyndon Words Formalized in {I}sabelle/{HOL}},
  year = {2021},
  isbn = {978-3-030-81507-3},
  publisher = {Springer-Verlag},
  address = {Berlin, Heidelberg},
  doi = {10.1007/978-3-030-81508-0_18},
  booktitle = {Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings},
  pages = {217–-228},
  numpages = {12},
  keywords = {Lyndon factorization, Isabelle/HOL, Combinatorics on words, Lyndon word},
  location = {Porto, Portugal}
}

@inproceedings{reversal_FMM,
  title = {Producing symmetrical facts for lists induced by the list reversal mapping in {Isabelle/HOL}},
  author = {Raška, Martin and Starosta, Štěpán},
  booktitle = {Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on
                 Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021)},
  editor = {Blanchette, Jasmin and Davenport, James and Koepke, Peter and Kohlhase, Michael and Kohlhase, Andrea and Naumowicz, Adam and Müller, Dennis and Sharoda, Yasmine and Coen, Claudio Sacerdoti},
  year = {2021},
  url = {https://kwarc.info/teaching/CICM21WS/fmm2.pdf}
}

@article{BARBIERI2021103318,
  title = {A characterization of Sturmian sequences by indistinguishable asymptotic pairs},
  journal = {European Journal of Combinatorics},
  volume = {95},
  pages = {103318},
  year = {2021},
  issn = {0195-6698},
  doi = {10.1016/j.ejc.2021.103318},
  url = {https://www.sciencedirect.com/science/article/pii/S019566982100010X},
  author = {Barbieri, Sebastián and Labbé, Sébastien and Starosta, Štěpán}
}

@article{Combinatorics_Words-AFP,
  author = {{\v S}těpán Holub and Raška, Martin and {\v S}těpán Starosta},
  title = {Combinatorics on Words Basics},
  journal = {Archive of Formal Proofs},
  month = may,
  year = {2021},
  url = {https://isa-afp.org/entries/Combinatorics_Words.html},
  issn = {2150-914x}
}

@article{Combinatorics_Words_Graph_Lemma-AFP,
  author = {Holub, Štěpán and Starosta, Štěpán},
  title = {Graph Lemma},
  journal = {Archive of Formal Proofs},
  month = may,
  year = {2021},
  url = {https://isa-afp.org/entries/Combinatorics_Words_Graph_Lemma.html},
  issn = {2150-914x}
}

@article{Combinatorics_Words_Lyndon-AFP,
  author = {Holub, Štěpán and Starosta, Štěpán},
  title = {Lyndon words},
  journal = {Archive of Formal Proofs},
  month = may,
  year = {2021},
  url = {https://isa-afp.org/entries/Combinatorics_Words_Lyndon.html},
  issn = {2150-914x}
}

@article{RaSta1,
  title = {Bounds on the period of the continued fraction after a Möbius transformation},
  journal = {Journal of Number Theory},
  volume = {212},
  pages = {122--172},
  year = {2020},
  issn = {0022-314X},
  doi = {10.1016/j.jnt.2019.10.027},
  url = {https://www.sciencedirect.com/science/article/pii/S0022314X19303993},
  author = {Řada, Hanka and Starosta, Štěpán},
  keywords = {Continued fraction, Continued fraction period, Möbius transformation, Linear fractional transformation}
}

@inproceedings{KoSta19,
  author = {Ko{\v{s}}{\'i}k, V{\'a}clav and Starosta, {\v{S}}t{\v{e}}p{\'a}n},
  editor = {Merca{\c{s}}, Robert and Reidenbach, Daniel},
  title = {On Substitutions Closed Under Derivation: Examples},
  booktitle = {Combinatorics on Words},
  year = {2019},
  publisher = {Springer International Publishing},
  address = {Cham},
  pages = {226--237},
  isbn = {978-3-030-28796-2},
  series = {Lecture Notes in Computer Science},
  volume = {11682},
  url = {https://link.springer.com/chapter/10.1007/978-3-030-28796-2_18}
}

@article{KLOUDA2019131,
  title = {Characterization of circular D0L-systems},
  journal = {Theoretical Computer Science},
  volume = {790},
  pages = {131--137},
  year = {2019},
  issn = {0304-3975},
  doi = {10.1016/j.tcs.2019.04.021},
  url = {https://www.sciencedirect.com/science/article/pii/S0304397519303093},
  author = {Klouda, Karel and Starosta, Štěpán},
  keywords = {D0L-system, Circular D0L-system, Repetition}
}

@article{KlMePeSt18,
  author = {Klouda, Karel and Medkov{\'{a}}, Kate{\v r}ina and Pelantov{\'{a}}, Edita and {\v S}tep{\'{a}}n Starosta},
  title = {Fixed points of {S}turmian morphisms and their derivated words},
  journal = {Theoret. Comput. Sci.},
  volume = {743},
  pages = {23--37},
  year = {2018},
  doi = {10.1016/j.tcs.2018.06.037},
  timestamp = {Tue, 21 Aug 2018 15:31:48 +0200}
}

@article{LaPeSt17,
  author = {Labb\'e, S\'ebastien and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  title = {On the {Z}ero {D}efect {C}onjecture},
  journal = {Eur. J. Combin.},
  fjournal = {European Journal of Combinatorics},
  volume = {62},
  year = {2017},
  pages = {132--146},
  issn = {0195-6698},
  mrclass = {Prelim},
  mrnumber = {3621729},
  doi = {10.1016/j.ejc.2016.12.006}
}

@article{MaPeSta1,
  title = {Exchange of three intervals: substitutions and palindromicity},
  journal = {Eur. J. Combin.},
  author = {Masáková, Zuzana and Pelantová, Edita and {\v{S}}t\v{e}p\'an Starosta},
  year = {2017},
  volume = {62},
  pages = {217--231},
  doi = {10.1016/j.ejc.2017.01.003}
}

@inproceedings{10.1007/978-3-319-66396-8_7,
  author = {Pelantov{\'a}, Edita and Starosta, {\v{S}}t{\v{e}}p{\'a}n},
  editor = {Brlek, Sre{\v{c}}ko and Dolce, Francesco and Reutenauer, Christophe and Vandomme, {\'E}lise},
  title = {On Words with the Zero Palindromic Defect},
  booktitle = {Combinatorics on Words},
  year = {2017},
  publisher = {Springer International Publishing},
  address = {Cham},
  pages = {59--71},
  isbn = {978-3-319-66396-8},
  url = {https://link.springer.com/chapter/10.1007/978-3-319-66396-8_7}
}

@article{Sta2015,
  title = {Morphic images of episturmian words having finite palindromic defect},
  journal = {Eur. J. Combin.},
  author = {Starosta, {\v{S}}t\v{e}p\'an},
  year = {2016},
  volume = {51},
  pages = {359--371},
  doi = {10.1016/j.ejc.2015.07.001}
}

@article{PeStaZn,
  author = {Pelantová, Edita and {\v{S}}t\v{e}p\'an Starosta and Znojil, Miloslav},
  title = {Markov constant and quantum instabilities},
  journal = {J. Phys. A: Math. Theor.},
  volume = {49},
  number = {15},
  pages = {155201},
  doi = {10.1088/1751-8113/49/15/155201},
  url = {http://stacks.iop.org/1751-8121/49/i=15/a=155201},
  year = {2016}
}

@article{PeSta3,
  title = {Constructions of words rich in palindromes and pseudopalindromes},
  journal = {Discrete Math. Theoret. Comput. Sci.},
  volume = {18},
  number = {3},
  author = {Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  year = {2016},
  doi = {10.46298/dmtcs.655}
}

@article{MaPeSta_2016,
  title = {ITINERARIES INDUCED BY EXCHANGE OF THREE INTERVALS},
  volume = {56},
  url = {https://ojs.cvut.cz/ojs/index.php/ap/article/view/3794},
  doi = {10.14311/AP.2016.56.0462},
  abstractnote = {We focus on a generalization of the three gap theorem well known in the framework of exchange of two intervals. For the case of three intervals, our main result provides an analogue of this result implying that there are at most 5 gaps. To derive this result, we give a detailed description of the return times to a subinterval and the corresponding itineraries.},
  number = {6},
  journal = {Acta Polytechnica},
  author = {Masáková, Zuzana and Pelantová, Edita and Starosta, Štěpán},
  year = {2016},
  month = dec,
  pages = {462–-471}
}

@article{KuSta,
  title = {On the partitions with {S}turmian-like refinements},
  journal = {Discret. Contin. Dyn. S.},
  volume = {35},
  number = {8},
  pages = {3483--3501},
  year = {2015},
  note = {},
  issn = {1078-0947},
  doi = {10.3934/dcds.2015.35.3483},
  url = {http://aimsciences.org/journals/displayArticlesnew.jsp?paperID=10860},
  author = {Kupsa, Michal and {\v{S}}t\v{e}p\'an Starosta},
  keywords = {local rule}
}

@inproceedings{10.1007/978-3-319-21500-6_30,
  author = {Mas{\'a}kov{\'a}, Zuzana and Pelantov{\'a}, Edita and Starosta, {\v{S}}t{\v{e}}p{\'a}n},
  editor = {Potapov, Igor},
  title = {Interval Exchange Words and the Question of Hof, Knill, and Simon},
  booktitle = {Developments in Language Theory},
  year = {2015},
  publisher = {Springer International Publishing},
  address = {Cham},
  pages = {377--388},
  isbn = {978-3-319-21500-6},
  url = {https://link.springer.com/chapter/10.1007/978-3-319-21500-6_30}
}

@article{KlSt1,
  author = {Klouda, Karel and {\v S}t{\v e}p\'an Starosta},
  title = {An Algorithm Enumerating All Infinite Repetitions in a {D0L}-System},
  journal = {J. Discrete Algorithms},
  volume = {33},
  year = {2015},
  pages = {130--138},
  doi = {10.1016/j.jda.2015.03.006}
}

@article{PeSta2,
  title = {Palindromic richness for languages invariant under more symmetries},
  journal = {Theoret. Comput. Sci},
  author = {Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  volume = {518},
  pages = {42--63},
  year = {2014},
  keywords = {{68R15,} Mathematics - Combinatorics},
  doi = {10.1016/j.tcs.2013.07.021}
}

@article{JaPeSta1,
  title = {Palindromic closures using multiple antimorphisms},
  journal = {Theoret. Comput. Sci.},
  volume = {533},
  number = {},
  pages = {37--45},
  year = {2014},
  note = {},
  issn = {0304-3975},
  doi = {10.1016/j.tcs.2014.03.020},
  author = {Jajcayová, Tatiana and Pelantová, Edita and {\v S}těpán Starosta},
  keywords = {Involutory antimorphism }
}

@article{BaPeSta5,
  title = {Proof of the {Brlek-Reutenauer} conjecture},
  issn = {0304-3975},
  doi = {10.1016/j.tcs.2012.12.024},
  urldate = {2013-02-03},
  journal = {Theoret. Comput. Sci.},
  year = {2013},
  volume = {475},
  pages = {120--125},
  author = {Balkov\'a, {L'}ubom\'{\i}ra and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  file = {ScienceDirect Full Text PDF:C:\Users\sark\AppData\Roaming\Mozilla\Firefox\Profiles\6qj6ek81.default\zotero\storage\NUKAEFDG\Balková et al. - Proof of the Brlek–Reutenauer conjecture.pdf:application/pdf;ScienceDirect Snapshot:C:\Users\sark\AppData\Roaming\Mozilla\Firefox\Profiles\6qj6ek81.default\zotero\storage\8XRPVJAS\S0304397512011395.html:text/html}
}

@article{PeSta1,
  title = {Languages invariant under more symmetries: overlapping factors versus palindromic richness},
  shorttitle = {Languages invariant under more symmetries},
  url_off = {http://arxiv.org/abs/1103.4051},
  journal = {Discrete Math.},
  author = {Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  year = {2013},
  volume = {313},
  pages = {2432--2445},
  doi = {10.1016/j.disc.2013.07.00}
}

@incollection{ArSta,
  author = {Arnoux, Pierre and {\v{S}}t\v{e}p\'an Starosta},
  title = {The {R}auzy gasket},
  booktitle = {Further Developments in Fractals and Related Fields},
  series = {Trends in Mathematics},
  editor = {Barral, J. and Seuret, S.},
  pages = {1--23},
  publisher = {Springer Science+Business Media New York},
  year = {2013},
  url = {https://link.springer.com/chapter/10.1007/978-0-8176-8400-6_1}
}

@article{doi:10.1142/S012905411240045X,
  author = {Pelantová, Edita and Starosta, \v{S}t\'{e}p\'{a}n},
  title = {Almost rich words as morphic images of rich words},
  journal = {International Journal of Foundations of Computer Science},
  volume = {23},
  number = {05},
  pages = {1067--1083},
  year = {2012},
  doi = {10.1142/S012905411240045X}
}

@article{Sta2011,
  title = {Generalized {Thue-Morse} words and palindromic richness},
  author = {Starosta, {\v{S}}t\v{e}p\'an},
  journal = {Kybernetika},
  volume = {48},
  number = {3},
  pages = {361--370},
  year = {2012},
  pdf = {https://www.kybernetika.cz/content/2012/3/361/paper.pdf}
}

@article{BaPeSta3,
  author = {Balkov\'a, {L'}ubom\'{\i}ra and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  title = {Infinite words with finite defect},
  journal = {Adv. in Appl. Math.},
  volume = {47},
  number = {3},
  pages = {562--574},
  year = {2011},
  issn = {0196-8858},
  doi = {10.1016/j.aam.2010.11.006}
}

@article{BaPeSta4,
  author = {Balkov\'a, {L'}ubom\'{\i}ra and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  title = {{On {B}rlek-{R}eutenauer conjecture}},
  journal = {Theoret. Comput. Sci.},
  volume = {412},
  number = {41},
  pages = {5649--5655},
  keywords = {Mathematics - Combinatorics},
  year = {2011},
  doi = {0.1016/j.tcs.2011.06.031}
}

@incollection{PeSta_Milano,
  author = {Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  affiliation = {Department of Mathematics, FNSPE, Czech Technical University in Prague, Trojanova 13, 120 00 Praha 2, Czech Republic},
  title = {Infinite Words Rich and Almost Rich in Generalized Palindromes},
  booktitle = {Developments in Language Theory},
  series = {Lecture Notes in Computer Science},
  editor = {Mauri, Giancarlo and Leporati, Alberto},
  publisher = {Springer-Verlag, Berlin, Heidelberg},
  isbn = {},
  pages = {406--416},
  volume = {6795},
  year = {2011},
  url = {https://link.springer.com/chapter/10.1007/978-3-642-22321-1_35}
}

@article{Sta2010,
  author = {Starosta, {\v{S}}t\v{e}p\'an},
  title = {On theta-palindromic richness},
  journal = {Theoret. Comput. Sci.},
  volume = {412},
  number = {12-14},
  pages = {1111--1121},
  year = {2011},
  issn = {0304-3975},
  doi = {10.1016/j.tcs.2010.12.011}
}

@article{BaPeSta2,
  author = {Balkov\'a, {L'}ubom\'{\i}ra and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  title = {Sturmian Jungle (or Garden?) on Multiliteral Alphabets},
  doi = {10.1051/ita/2011002},
  url_off = {},
  journal = {RAIRO-Theor. Inf. Appl.},
  volume = {44},
  pages = {443--470},
  year = {2010}
}

@article{BaPeSta,
  author = {Balkov\'a, {L'}ubom\'{\i}ra and Pelantov\'a, Edita and Starosta, {\v{S}}t\v{e}p\'an},
  title = {Palindromes in infinite ternary words},
  doi = {10.1051/ita/2009016},
  journal = {RAIRO-Theor. Inf. Appl.},
  year = {2009},
  volume = {43},
  number = {4},
  pages = {687--702},
  month = oct
}