Peter Kostolányi

According to our database, Peter Kostolányi authored at least 15 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Bideterministic weighted automata.

Peter Kostolányi

Inf. Comput., December, 2023

Polynomially Ambiguous Unary Weighted Automata over Fields.

Peter Kostolányi

Theory Comput. Syst., April, 2023

On some decidability questions concerning supports of rational series.

Peter Kostolányi

Inf. Process. Lett., 2023

Weighted Automata and Logics Meet Computational Complexity.

Peter Kostolányi

CoRR, 2023

2022

Determinisability of unary weighted automata over the rational numbers.

Peter Kostolányi

Theor. Comput. Sci., 2022

Geometrically closed positive varieties of languages.

Ondrej Klíma, Peter Kostolányi

Inf. Comput., 2022

Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields.

Peter Kostolányi

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Rational elements of summation semirings.

Peter Kostolányi

Theor. Comput. Sci., 2021

2020

Geometrically Closed Positive Varieties of Star-Free Languages.

Ondrej Klíma, Peter Kostolányi

Proceedings of the Language and Automata Theory and Applications, 2020

2019

A Unifying Approach to Algebraic Systems Over Semirings.

Peter Kostolányi

Theory Comput. Syst., 2019

2018

Alternating weighted automata over commutative semirings.

Peter Kostolányi, Filip Misún

Theor. Comput. Sci., 2018

On deterministic weighted automata.

Peter Kostolányi

Inf. Process. Lett., 2018

2016

A pumping lemma for flip-pushdown languages.

Peter Kostolányi

RAIRO Theor. Informatics Appl., 2016

Automata with Auxiliary Weights.

Peter Kostolányi, Branislav Rovan

Int. J. Found. Comput. Sci., 2016

2015

Two Grammatical Equivalents of Flip-Pushdown Automata.

Peter Kostolányi

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015