| Publication | Date of Publication | Type |
|---|
| Note on dissecting power of regular languages | 2025-11-14 | Paper |
Palindromic length of infinite aperiodic words
European Journal of Combinatorics | 2025-10-23 | Paper |
Dissecting power of intersection of two context-free languages
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
Construction of a bi-infinite power free word with a given factor and a non-recurrent letter
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
Secretary problem and two almost the same consecutive applicants
Mathematica Applicanda | 2023-07-25 | Paper |
| Property of upper bounds on the number of rich words | 2022-12-18 | Paper |
Upper bound for the number of privileged words
Discrete Mathematics | 2022-11-02 | Paper |
Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
Developments in Language Theory | 2022-10-13 | Paper |
Palindromic length and reduction of powers
Theoretical Computer Science | 2022-08-25 | Paper |
Palindromic factorization of rich words
Discrete Applied Mathematics | 2022-05-30 | Paper |
Upper bound for the number of privileged words
(available as arXiv preprint) | 2022-05-25 | Paper |
Upper bound for palindromic and factor complexity of rich words
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
A unique extension of rich words
Theoretical Computer Science | 2021-11-18 | Paper |
Palindromic factorization of rich words
(available as arXiv preprint) | 2021-10-25 | Paper |
Palindromic length of words with many periodic palindromes
(available as arXiv preprint) | 2021-07-14 | Paper |
Palindromic Length and Reduction of Powers
(available as arXiv preprint) | 2021-03-26 | Paper |
Upper bound for the number of closed and privileged words
Information Processing Letters | 2020-02-11 | Paper |
Transition Property for \alpha-Power Free Languages with \alpha\geq 2 and k\geq 3 Letters
(available as arXiv preprint) | 2020-01-07 | Paper |
Bijections in de Bruijn graphs.
(available as arXiv preprint) | 2019-12-18 | Paper |
Rich words containing two given factors
(available as arXiv preprint) | 2019-11-06 | Paper |
A Unique Extension of Rich Words
(available as arXiv preprint) | 2019-10-02 | Paper |
Upper Bound for Palindromic and Factor Complexity of Rich Words
(available as arXiv preprint) | 2018-10-08 | Paper |
On the number of rich words
(available as arXiv preprint) | 2017-10-13 | Paper |
| Dickson's method for generating Pythagorean triples revisited | 2017-04-05 | Paper |
A note on divisors of multinomial coefficients
Archiv der Mathematik | 2015-06-24 | Paper |
An envelope for left alternative algebras
International Journal of Algebra | 2014-10-06 | Paper |
On generalized Dyck paths
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
On generalized Dyck paths
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
