default search action
Stepán Starosta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j29]Karel Klouda, Stepán Starosta:
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite. J. Comb. Theory, Ser. A 206: 105904 (2024) - 2023
- [j28]Stepan Holub, Stepán Starosta:
Intersection of two monoids generated by two element codes. Arch. Formal Proofs 2023 (2023) - [j27]Jana Lepsová, Edita Pelantová, Stepán Starosta:
On a faithful representation of Sturmian morphisms. Eur. J. Comb. 110: 103707 (2023) - [j26]Stepan Holub, Martin Raska, Stepán Starosta:
Binary Codes that do not Preserve Primitivity. J. Autom. Reason. 67(3): 25 (2023) - [i9]Stepán Starosta:
Infinite Words and Morphic Languages Formalized in Isabelle/HOL. CoRR abs/2303.11445 (2023) - 2022
- [c8]Stepan Holub, Martin Raska
, Stepán Starosta:
Binary Codes that Do Not Preserve Primitivity. IJCAR 2022: 369-387 - [i8]Jana Lepsová, Edita Pelantová, Stepán Starosta:
On a faithful representation of Sturmian morphisms. CoRR abs/2203.00373 (2022) - [i7]Stepan Holub, Martin Raska, Stepán Starosta:
Binary codes that do not preserve primitivity. CoRR abs/2203.11341 (2022) - 2021
- [j25]Stepan Holub, Martin Raska, Stepán Starosta:
Combinatorics on Words Basics. Arch. Formal Proofs 2021 (2021) - [j24]Stepan Holub, Stepán Starosta:
Graph Lemma. Arch. Formal Proofs 2021 (2021) - [j23]Stepan Holub, Stepán Starosta:
Lyndon words. Arch. Formal Proofs 2021 (2021) - [j22]Sebastián Barbieri
A characterization of Sturmian sequences by indistinguishable asymptotic pairs. Eur. J. Comb. 95: 103318 (2021) - [j21]Stepan Holub, Stepán Starosta:
Binary intersection formalized. Theor. Comput. Sci. 866: 14-24 (2021) - [j20]Edita Pelantová, Stepán Starosta:
On Sturmian substitutions closed under derivation. Theor. Comput. Sci. 867: 128-139 (2021) - [c7]Stepan Holub, Stepán Starosta:
Lyndon Words Formalized in Isabelle/HOL. DLT 2021: 217-228 - [c6]Stepan Holub, Stepán Starosta:
Formalization of Basic Combinatorics on Words. ITP 2021: 22:1-22:17 - [c5]Martin Raska, Stepán Starosta:
Producing Symmetrical Facts for lIsts induced by the List Reversal Mapping in Isabelle/HOL (short paper). CICM Workshops 2021 - [i6]Martin Raska, Stepán Starosta:
Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL. CoRR abs/2104.11622 (2021) - 2020
- [i5]Stepan Holub, Stepán Starosta:
Binary intersection formalized. CoRR abs/2006.16711 (2020)
2010 – 2019
- 2019
- [j19]Karel Klouda, Stepán Starosta:
Characterization of circular D0L-systems. Theor. Comput. Sci. 790: 131-137 (2019) - [c4]Václav Kosík, Stepán Starosta:
On Substitutions Closed Under Derivation: Examples. WORDS 2019: 226-237 - [i4]Václav Kosík, Stepán Starosta:
On substitutions closed under derivation: examples. CoRR abs/1907.05751 (2019) - 2018
- [j18]Karel Klouda, Katerina Medková, Edita Pelantová
Fixed points of Sturmian morphisms and their derivated words. Theor. Comput. Sci. 743: 23-37 (2018) - 2017
- [j17]Sébastien Labbé
On the Zero Defect Conjecture. Eur. J. Comb. 62: 132-146 (2017) - [j16]Zuzana Masáková, Edita Pelantová
Exchange of three intervals: Substitutions and palindromicity. Eur. J. Comb. 62: 217-231 (2017) - [c3]Edita Pelantová
On Words with the Zero Palindromic Defect. WORDS 2017: 59-71 - 2016
- [j15]Edita Pelantová
Constructions of words rich in palindromes and pseudopalindromes. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [j14]Stepán Starosta:
Morphic images of episturmian words having finite palindromic defect. Eur. J. Comb. 51: 359-371 (2016) - [i3]Sébastien Labbé, Edita Pelantová, Stepán Starosta:
On the Zero Defect Conjecture. CoRR abs/1606.05525 (2016) - 2015
- [j13]Karel Klouda
An algorithm for enumerating all infinite repetitions in a D0L-system. J. Discrete Algorithms 33: 130-138 (2015) - [c2]Zuzana Masáková, Edita Pelantová
Interval Exchange Words and the Question of Hof, Knill, and Simon. DLT 2015: 377-388 - 2014
- [j12]Edita Pelantová
Palindromic richness for languages invariant under more symmetries. Theor. Comput. Sci. 518: 42-63 (2014) - [j11]Tatiana Jajcayová, Edita Pelantová
Palindromic closures using multiple antimorphisms. Theor. Comput. Sci. 533: 37-45 (2014) - 2013
- [j10]Edita Pelantová
Languages invariant under more symmetries: Overlapping factors versus palindromic richness. Discret. Math. 313(21): 2432-2445 (2013) - [j9]L'ubomíra Balková
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475: 120-125 (2013) - [i2]Karel Klouda, Stepán Starosta:
An Algorithm Enumerating All Infinite Repetitions in a D0L System. CoRR abs/1307.6408 (2013) - 2012
- [j8]Edita Pelantová
Almost Rich Words as Morphic Images of Rich Words. Int. J. Found. Comput. Sci. 23(5): 1067-1084 (2012) - [j7]Stepán Starosta:
Generalized Thue-Morse words and palindromic richnes. Kybernetika 48(3): 361-370 (2012) - [j6]L'ubomíra Balková
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465: 73-74 (2012) - [i1]L'ubomíra Balková, Edita Pelantová, Stepán Starosta:
Proof of Brlek-Reutenauer conjecture. CoRR abs/1208.2505 (2012) - 2011
- [j5]L'ubomíra Balková
Infinite words with finite defect. Adv. Appl. Math. 47(3): 562-574 (2011) - [j4]Stepán Starosta:
On theta-palindromic richness. Theor. Comput. Sci. 412(12-14): 1111-1121 (2011) - [j3]L'ubomíra Balková
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412(41): 5649-5655 (2011) - [c1]Edita Pelantová
Infinite Words Rich and Almost Rich in Generalized Palindromes. Developments in Language Theory 2011: 406-416 - 2010
- [j2]L'ubomíra Balková
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44(4): 443-470 (2010)
2000 – 2009
- 2009
- [j1]L'ubomíra Balková
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43(4): 687-702 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: