default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kostolányi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j14]Peter Kostolányi
:
Free products of semigroups and monoids with a deterministic context-free word problem. Inf. Process. Lett. 188: 106541 (2025)- 2024
- [j13]Peter Kostolányi:
Weighted automata and logics meet computational complexity. Inf. Comput. 301: 105213 (2024) - [j12]Peter Kostolányi:
Finitely ambiguous and finitely sequential weighted automata over fields. Theor. Comput. Sci. 1012: 114725 (2024) - 2023
- [j11]Peter Kostolányi:
Bideterministic weighted automata. Inf. Comput. 295(Part B): 105093 (2023) - [j10]Peter Kostolányi:
On some decidability questions concerning supports of rational series. Inf. Process. Lett. 179: 106290 (2023) - [j9]Peter Kostolányi:
Polynomially Ambiguous Unary Weighted Automata over Fields. Theory Comput. Syst. 67(2): 291-309 (2023) - 2022
- [j8]Ondrej Klíma, Peter Kostolányi:
Geometrically closed positive varieties of languages. Inf. Comput. 288: 104709 (2022) - [j7]Peter Kostolányi:
Determinisability of unary weighted automata over the rational numbers. Theor. Comput. Sci. 898: 110-131 (2022) - 2021
- [j6]Peter Kostolányi:
Rational elements of summation semirings. Theor. Comput. Sci. 867: 101-127 (2021) - 2019
- [j5]Peter Kostolányi:
A Unifying Approach to Algebraic Systems Over Semirings. Theory Comput. Syst. 63(3): 615-633 (2019) - 2018
- [j4]Peter Kostolányi:
On deterministic weighted automata. Inf. Process. Lett. 140: 42-47 (2018) - [j3]Peter Kostolányi, Filip Misún:
Alternating weighted automata over commutative semirings. Theor. Comput. Sci. 740: 1-27 (2018) - 2016
- [j2]Peter Kostolányi, Branislav Rovan:
Automata with Auxiliary Weights. Int. J. Found. Comput. Sci. 27(7): 787-808 (2016) - [j1]Peter Kostolányi:
A pumping lemma for flip-pushdown languages. RAIRO Theor. Informatics Appl. 50(4): 295-311 (2016)
Conference and Workshop Papers
- 2022
- [c5]Peter Kostolányi:
Bideterministic Weighted Automata. CAI 2022: 161-174 - [c4]Peter Kostolányi:
Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields. CSR 2022: 209-223 - 2020
- [c3]Ondrej Klíma, Peter Kostolányi:
Geometrically Closed Positive Varieties of Star-Free Languages. LATA 2020: 328-340 - 2015
- [c2]Peter Kostolányi:
A pumping lemma for flip-pushdown languages. NCMA 2015: 125-140 - [c1]Peter Kostolányi:
Two Grammatical Equivalents of Flip-Pushdown Automata. SOFSEM 2015: 302-313
Informal and Other Publications
- 2023
- [i2]Peter Kostolányi:
Bideterministic Weighted Automata. CoRR abs/2303.10631 (2023) - [i1]Peter Kostolányi:
Weighted Automata and Logics Meet Computational Complexity. CoRR abs/2312.10810 (2023)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
