Two Grammatical Equivalents of Flip-Pushdown Automata. - Peter Kostolányi (SOFSEM, 2015)

Automata with Auxiliary Weights. - Peter Kostolányi; Branislav Rovan (Int. J. Found. Comput. Sci., 2016)

A pumping lemma for flip-pushdown languages. - Peter Kostolányi (RAIRO Theor. Informatics Appl., 2016)

On deterministic weighted automata. - Peter Kostolányi (Inf. Process. Lett., 2018)

Alternating weighted automata over commutative semirings. - Peter Kostolányi; Filip Misún (Theor. Comput. Sci., 2018)

A Unifying Approach to Algebraic Systems Over Semirings. - Peter Kostolányi (Theory Comput. Syst., 2019)

Geometrically Closed Positive Varieties of Star-Free Languages. - Ondrej Klíma 001; Peter Kostolányi (LATA, 2020)

Rational elements of summation semirings. - Peter Kostolányi (Theor. Comput. Sci., 2021)

Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. - Peter Kostolányi (CSR, 2022)

Geometrically closed positive varieties of languages. - Ondrej Klíma 001; Peter Kostolányi (Inf. Comput., 2022)

Determinisability of unary weighted automata over the rational numbers. - Peter Kostolányi (Theor. Comput. Sci., 2022)

On some decidability questions concerning supports of rational series. - Peter Kostolányi (Inf. Process. Lett., 2023)

Polynomially Ambiguous Unary Weighted Automata over Fields. - Peter Kostolányi (Theory Comput. Syst., 2023)

Bideterministic weighted automata. - Peter Kostolányi (Inf. Comput., 2023)

Weighted automata and logics meet computational complexity. - Peter Kostolányi (Inf. Comput., 2024)

Finitely ambiguous and finitely sequential weighted automata over fields. - Peter Kostolányi (Theor. Comput. Sci., 2024)

Free products of semigroups and monoids with a deterministic context-free word problem. - Peter Kostolányi (Inf. Process. Lett., 2025)

Commutative semigroups with a context-free word problem. - Peter Kostolányi (Int. J. Algebra Comput., 2025)