Peter Kostolányi

23 papers B 1C 1Misc 1Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents.
CoRR
Peter Kostolányi, Andrej Ravinger
2025 J jnl
Commutative semigroups with a context-free word problem.
Int. J. Algebra Comput.
Peter Kostolányi
2025 J jnl
Free products of semigroups and monoids with a deterministic context-free word problem.
Inf. Process. Lett.
Peter Kostolányi
2024 J jnl
Finitely ambiguous and finitely sequential weighted automata over fields.
Theor. Comput. Sci.
Peter Kostolányi
2024 J jnl
Weighted automata and logics meet computational complexity.
Inf. Comput.
Peter Kostolányi
2023 J jnl
Bideterministic Weighted Automata.
CoRR
Peter Kostolányi
2023 J jnl
Bideterministic weighted automata.
Inf. Comput.
Peter Kostolányi
2023 J jnl
On some decidability questions concerning supports of rational series.
Inf. Process. Lett.
Peter Kostolányi
2023 J jnl
Polynomially Ambiguous Unary Weighted Automata over Fields.
Theory Comput. Syst.
Peter Kostolányi
2023 J jnl
Weighted Automata and Logics Meet Computational Complexity.
CoRR
Peter Kostolányi
2022 — conf
Bideterministic Weighted Automata.
CAI
Peter Kostolányi
2022 J jnl
Determinisability of unary weighted automata over the rational numbers.
Theor. Comput. Sci.
Peter Kostolányi
2022 Misc conf
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields.
CSR
Peter Kostolányi
2022 J jnl
Geometrically closed positive varieties of languages.
Inf. Comput.
Ondrej Klíma, Peter Kostolányi
2021 J jnl
Rational elements of summation semirings.
Theor. Comput. Sci.
Peter Kostolányi
2020 C conf
Geometrically Closed Positive Varieties of Star-Free Languages.
LATA
Ondrej Klíma, Peter Kostolányi
2019 J jnl
A Unifying Approach to Algebraic Systems Over Semirings.
Theory Comput. Syst.
Peter Kostolányi
2018 J jnl
Alternating weighted automata over commutative semirings.
Theor. Comput. Sci.
Peter Kostolányi, Filip Misún
2018 J jnl
On deterministic weighted automata.
Inf. Process. Lett.
Peter Kostolányi
2016 J jnl
A pumping lemma for flip-pushdown languages.
RAIRO Theor. Informatics Appl.
Peter Kostolányi
2016 J jnl
Automata with Auxiliary Weights.
Int. J. Found. Comput. Sci.
Peter Kostolányi, Branislav Rovan
2015 — conf
A pumping lemma for flip-pushdown languages.
NCMA
Peter Kostolányi
2015 B conf
Two Grammatical Equivalents of Flip-Pushdown Automata.
SOFSEM
Peter Kostolányi