Peter Kostolányi

Orcid: 0000-0002-5474-8781

According to our database1, Peter Kostolányi authored at least 17 papers between 2015 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Free products of semigroups and monoids with a deterministic context-free word problem.
Inf. Process. Lett., 2025

2024
Finitely ambiguous and finitely sequential weighted automata over fields.
Theor. Comput. Sci., 2024

Weighted automata and logics meet computational complexity.
Inf. Comput., 2024

2023
Bideterministic weighted automata.
Inf. Comput., December, 2023

Polynomially Ambiguous Unary Weighted Automata over Fields.
Theory Comput. Syst., April, 2023

On some decidability questions concerning supports of rational series.
Inf. Process. Lett., 2023

2022
Determinisability of unary weighted automata over the rational numbers.
Theor. Comput. Sci., 2022

Geometrically closed positive varieties of languages.
Inf. Comput., 2022

Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields.
Proceedings of the Computer Science - Theory and Applications, 2022

2021
Rational elements of summation semirings.
Theor. Comput. Sci., 2021

2020
Geometrically Closed Positive Varieties of Star-Free Languages.
Proceedings of the Language and Automata Theory and Applications, 2020

2019
A Unifying Approach to Algebraic Systems Over Semirings.
Theory Comput. Syst., 2019

2018
Alternating weighted automata over commutative semirings.
Theor. Comput. Sci., 2018

On deterministic weighted automata.
Inf. Process. Lett., 2018

2016
A pumping lemma for flip-pushdown languages.
RAIRO Theor. Informatics Appl., 2016

Automata with Auxiliary Weights.
Int. J. Found. Comput. Sci., 2016

2015
Two Grammatical Equivalents of Flip-Pushdown Automata.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015


  Loading...