default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Köcher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Chris Köcher:
Verification of Automata with Storage Mechanisms. Technische Universität Ilmenau, Germany, TU Ilmenau 2022, ISBN 978-3-86360-265-9
Journal Articles
- 2025
- [j4]Chris Köcher
, Dietrich Kuske:
Backwards-reachability for cooperating multi-pushdown systems. J. Comput. Syst. Sci. 148: 103601 (2025) - 2022
- [j3]Chris Köcher:
Rational, recognizable, and aperiodic partially lossy queue languages. Int. J. Algebra Comput. 32(3): 483-528 (2022) - 2021
- [j2]Chris Köcher:
Reachability Problems on Reliable and Lossy Queue Automata. Theory Comput. Syst. 65(8): 1211-1242 (2021) - 2018
- [j1]Chris Köcher, Dietrich Kuske, Olena Prianychnykova:
The inclusion structure of partially lossy queue monoids and their trace submonoids. RAIRO Theor. Informatics Appl. 52(1): 55-86 (2018)
Conference and Workshop Papers
- 2023
- [c6]Chris Köcher, Dietrich Kuske:
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. FCT 2023: 318-332 - [c5]Chris Köcher, Georg Zetzsche:
Regular Separators for VASS Coverability Languages. FSTTCS 2023: 15:1-15:19 - 2019
- [c4]Chris Köcher:
Reachability Problems on Partially Lossy Queue Automata. RP 2019: 149-163 - 2018
- [c3]Faried Abu Zaid, Chris Köcher:
The Cayley-Graph of the Queue Monoid: Logic and Decidability. FSTTCS 2018: 9:1-9:17 - [c2]Chris Köcher:
Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. STACS 2018: 45:1-45:14 - 2017
- [c1]Chris Köcher, Dietrich Kuske:
The Transformation Monoid of a Partially Lossy Queue. CSR 2017: 191-205
Informal and Other Publications
- 2024
- [i2]Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche:
The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective. CoRR abs/2405.16166 (2024) - [i1]Elias Rojas Collins, Chris Köcher, Georg Zetzsche:
The complexity of separability for semilinear sets and Parikh automata. CoRR abs/2410.00548 (2024)
Coauthor Index
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 2024-12-10 21:45 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:
