| |
Title |
Co-author(s) |
Venue |
Pages |
Year |
Manuscript |
Final version |
| [19] |
Free Products of Semigroups and Monoids with a Deterministic Context-Free Word Problem |
– |
Inf. Process. Lett. 188 |
Article 106541 |
2025 |
PDF |
ScienceDirect |
| [18] |
Weighted Automata and Logics Meet Computational Complexity |
– |
Inf. Comput. 301, Part A |
Article 105213 |
2024 |
PDF |
ScienceDirect |
| [17] |
Finitely Ambiguous and Finitely Sequential Weighted Automata over Fields |
– |
Theor. Comput. Sci. 1012 |
Article 114725 |
2024 |
PDF |
ScienceDirect |
| [16] |
Bideterministic Weighted Automata |
– |
Inf. Comput. 295, Part B |
Article 105093 |
2023 |
PDF |
ScienceDirect |
| [15] |
Polynomially Ambiguous Unary Weighted Automata over Fields |
– |
Theory Comput. Syst. 67 |
291 – 309 |
2023 |
PDF |
SpringerLink |
| [14] |
On Some Decidability Questions Concerning Supports of Rational Series |
– |
Inf. Process. Lett. 179 |
Article 106290 |
2023 |
PDF |
ScienceDirect |
| [13] |
Bideterministic Weighted Automata |
– |
CAI 2022 |
161 – 174 |
2022 |
PDF |
SpringerLink |
| [12] |
Geometrically Closed Positive Varieties of Languages |
Ondřej Klíma |
Inf. Comput. 288 |
Article 104709 |
2022 |
PDF |
ScienceDirect |
| [11] |
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields |
– |
CSR 2022 |
209 – 223 |
2022 |
PDF |
SpringerLink |
| [10] |
Determinisability of Unary Weighted Automata over the Rational Numbers |
– |
Theor. Comput. Sci. 898 |
110 – 131 |
2022 |
PDF |
ScienceDirect |
| [9] |
Rational Elements of Summation Semirings |
– |
Theor. Comput. Sci. 867 |
101 – 127 |
2021 |
PDF |
ScienceDirect |
| [8] |
Geometrically Closed Positive Varieties of Star-Free Languages |
Ondřej Klíma |
LATA 2020 |
328 – 340 |
2020 |
PDF |
SpringerLink |
| [7] |
A Unifying Approach to Algebraic Systems over Semirings |
– |
Theory Comput. Syst. 63 |
615 – 633 |
2019 |
PDF |
SpringerLink |
| [6] |
On Deterministic Weighted Automata |
– |
Inf. Process. Lett. 140 |
42 – 47 |
2018 |
PDF |
ScienceDirect |
| [5] |
Alternating Weighted Automata over Commutative Semirings |
Filip Mišún |
Theor. Comput. Sci. 740 |
1 – 27 |
2018 |
PDF |
ScienceDirect |
| [4] |
Automata with Auxiliary Weights |
Branislav Rovan |
Int. J. Found. Comput. Sci. 27(7) |
787 – 807 |
2016 |
PDF |
World Scientific |
| [3] |
A Pumping Lemma for Flip-Pushdown Languages |
– |
RAIRO – Theor. Inf. and Applic. 50(4) |
295 – 311 |
2016 |
PDF |
EDP Sciences |
| [2] |
A Pumping Lemma for Flip-Pushdown Languages |
– |
NCMA 2015 |
125 – 140 |
2015 |
see [3] |
see [3] |
| [1] |
Two Grammatical Equivalents of Flip-Pushdown Automata |
– |
SOFSEM 2015 |
302 – 313 |
2015 |
PDF |
SpringerLink |