Chris Köcher

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The complexity of separability for semilinear sets and Parikh automata	2026-08-05	Paper
Reachability in trace-pushdown systems Theoretical Computer Science	2026-06-15	Paper
Regular separators for VASS coverability languages	2025-07-28	Paper
Backwards-reachability for cooperating multi-pushdown systems Journal of Computer and System Sciences	2024-12-27	Paper
Forwards- and backwards-reachability for cooperating multi-pushdown systems	2024-05-29	Paper
The Cayley-graph of the queue monoid: logic and decidability	2022-07-21	Paper
Rational, recognizable, and aperiodic partially lossy queue languages International Journal of Algebra and Computation	2022-05-11	Paper
Reachability problems on reliable and lossy queue automata Theory of Computing Systems	2021-12-18	Paper
Rational, recognizable, and aperiodic sets in the partially lossy queue monoid	2020-08-05	Paper
Reachability problems on partially lossy queue automata	2019-10-22	Paper
The inclusion structure of partially lossy queue monoids and their trace submonoids RAIRO - Theoretical Informatics and Applications	2018-11-01	Paper
The transformation monoid of a partially lossy queue	2017-08-22	Paper

Research outcomes over time

This page was built for person: Chris Köcher