Peter Kostolányi

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 18

Top Topics

Expressive Power

Finite Automata

Top Venues

Theor. Comput. Sci.

Inf. Process. Lett.

Publications

Peter Kostolányi
Weighted automata and logics meet computational complexity. Inf. Comput. 301 (2024)
Peter Kostolányi
Finitely ambiguous and finitely sequential weighted automata over fields. Theor. Comput. Sci. 1012 (2024)
Peter Kostolányi
Bideterministic weighted automata. Inf. Comput. 295 (Part B) (2023)
Peter Kostolányi
On some decidability questions concerning supports of rational series. Inf. Process. Lett. 179 (2023)
Peter Kostolányi
Bideterministic Weighted Automata. CoRR (2023)
Peter Kostolányi
Polynomially Ambiguous Unary Weighted Automata over Fields. Theory Comput. Syst. 67 (2) (2023)
Peter Kostolányi
Weighted Automata and Logics Meet Computational Complexity. CoRR (2023)
Peter Kostolányi
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. CSR (2022)
Peter Kostolányi
Determinisability of unary weighted automata over the rational numbers. Theor. Comput. Sci. 898 (2022)
Peter Kostolányi
Bideterministic Weighted Automata. CAI (2022)
Ondrej Klíma, Peter Kostolányi
Geometrically closed positive varieties of languages. Inf. Comput. 288 (2022)
Peter Kostolányi
Rational elements of summation semirings. Theor. Comput. Sci. 867 (2021)
Ondrej Klíma, Peter Kostolányi
Geometrically Closed Positive Varieties of Star-Free Languages. LATA (2020)
Peter Kostolányi
A Unifying Approach to Algebraic Systems Over Semirings. Theory Comput. Syst. 63 (3) (2019)
Peter Kostolányi
On deterministic weighted automata. Inf. Process. Lett. 140 (2018)
Peter Kostolányi, Filip Misún
Alternating weighted automata over commutative semirings. Theor. Comput. Sci. 740 (2018)
Peter Kostolányi, Branislav Rovan
Automata with Auxiliary Weights. Int. J. Found. Comput. Sci. 27 (7) (2016)
Peter Kostolányi
A pumping lemma for flip-pushdown languages. RAIRO Theor. Informatics Appl. 50 (4) (2016)
Peter Kostolányi
A pumping lemma for flip-pushdown languages. NCMA (2015)
Peter Kostolányi
Two Grammatical Equivalents of Flip-Pushdown Automata. SOFSEM (2015)