We stand with Ukraine  

Stepán Starosta

According to our database1, Stepán Starosta authored at least 37 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Binary Codes that do not Preserve Primitivity.
[BibTeX]
[DOI]
Stepan Holub
,
Martin Raska
,
Stepán Starosta
J. Autom. Reason., September, 2023

On a faithful representation of Sturmian morphisms.
[BibTeX]
[DOI]
Jana Lepsová
,
Edita Pelantová
,
Stepán Starosta
Eur. J. Comb., May, 2023

Infinite Words and Morphic Languages Formalized in Isabelle/HOL.
[BibTeX]
[DOI]
Stepán Starosta
CoRR, 2023

Intersection of two monoids generated by two element codes.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Arch. Formal Proofs, 2023

2021
On Sturmian substitutions closed under derivation.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2021

Binary intersection formalized.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Theor. Comput. Sci., 2021

A characterization of Sturmian sequences by indistinguishable asymptotic pairs.
[BibTeX]
[DOI]
Sebastián Barbieri
,
Sébastien Labbé
,
Stepán Starosta
Eur. J. Comb., 2021

Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL.
[BibTeX]
[DOI]
Martin Raska
,
Stepán Starosta
CoRR, 2021

Lyndon words.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Arch. Formal Proofs, 2021

Graph Lemma.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Arch. Formal Proofs, 2021

Combinatorics on Words Basics.
[BibTeX]
[DOI]
Stepan Holub
,
Martin Raska
,
Stepán Starosta
Arch. Formal Proofs, 2021

Producing Symmetrical Facts for lIsts induced by the List Reversal Mapping in Isabelle/HOL (short paper).
[BibTeX]
[DOI]
Martin Raska
,
Stepán Starosta
Proceedings of the 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), Virtual Event, Timisoara, Romania, July 26, 2021

Formalization of Basic Combinatorics on Words.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

Lyndon Words Formalized in Isabelle/HOL.
[BibTeX]
[DOI]
Stepan Holub
,
Stepán Starosta
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2019
Characterization of circular D0L-systems.
[BibTeX]
[DOI]
Karel Klouda
,
Stepán Starosta
Theor. Comput. Sci., 2019

On Substitutions Closed Under Derivation: Examples.
[BibTeX]
[DOI]
Václav Kosík
,
Stepán Starosta
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
Fixed points of Sturmian morphisms and their derivated words.
[BibTeX]
[DOI]
Karel Klouda
,
Katerina Medková
,
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2018

2017
Exchange of three intervals: Substitutions and palindromicity.
[BibTeX]
[DOI]
Zuzana Masáková
,
Edita Pelantová
,
Stepán Starosta
Eur. J. Comb., 2017

On the Zero Defect Conjecture.
[BibTeX]
[DOI]
Sébastien Labbé
,
Edita Pelantová
,
Stepán Starosta
Eur. J. Comb., 2017

On Words with the Zero Palindromic Defect.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
Morphic images of episturmian words having finite palindromic defect.
[BibTeX]
[DOI]
Stepán Starosta
Eur. J. Comb., 2016

Constructions of words rich in palindromes and pseudopalindromes.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Discret. Math. Theor. Comput. Sci., 2016

2015
An algorithm for enumerating all infinite repetitions in a D0L-system.
[BibTeX]
[DOI]
Karel Klouda
,
Stepán Starosta
J. Discrete Algorithms, 2015

Interval Exchange Words and the Question of Hof, Knill, and Simon.
[BibTeX]
[DOI]
Zuzana Masáková
,
Edita Pelantová
,
Stepán Starosta
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Palindromic richness for languages invariant under more symmetries.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2014

Palindromic closures using multiple antimorphisms.
[BibTeX]
[DOI]
Tatiana Jajcayová
,
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2014

2013
Proof of the Brlek-Reutenauer conjecture.
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2013

Languages invariant under more symmetries: Overlapping factors versus palindromic richness.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Discret. Math., 2013

2012
Corrigendum: "On Brlek-Reutenauer conjecture".
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2012

Generalized Thue-Morse words and palindromic richnes.
[BibTeX]
[DOI]
Stepán Starosta
Kybernetika, 2012

Almost Rich Words as Morphic Images of Rich Words.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Int. J. Found. Comput. Sci., 2012

2011
On theta-palindromic richness.
[BibTeX]
[DOI]
Stepán Starosta
Theor. Comput. Sci., 2011

On Brlek-Reutenauer conjecture.
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
Theor. Comput. Sci., 2011

Infinite words with finite defect.
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
Adv. Appl. Math., 2011

Infinite Words Rich and Almost Rich in Generalized Palindromes.
[BibTeX]
[DOI]
Edita Pelantová
,
Stepán Starosta
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
Sturmian jungle (or garden?) on multiliteral alphabets.
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
RAIRO Theor. Informatics Appl., 2010

2009
Palindromes in infinite ternary words.
[BibTeX]
[DOI]
L'ubomíra Balková
,
Edita Pelantová
,
Stepán Starosta
RAIRO Theor. Informatics Appl., 2009


  Loading...