The Transformation Monoid of a Partially Lossy Queue. - Chris Köcher; Dietrich Kuske (CSR, 2017)

The Cayley-Graph of the Queue Monoid: Logic and Decidability. - Faried Abu Zaid; Chris Köcher (FSTTCS, 2018)

Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. - Chris Köcher (STACS, 2018)

The inclusion structure of partially lossy queue monoids and their trace submonoids. - Chris Köcher; Dietrich Kuske; Olena Prianychnykova (RAIRO Theor. Informatics Appl., 2018)

Reachability Problems on Partially Lossy Queue Automata. - Chris Köcher (RP, 2019)

Reachability Problems on Reliable and Lossy Queue Automata. - Chris Köcher (Theory Comput. Syst., 2021)

Rational, recognizable, and aperiodic partially lossy queue languages. - Chris Köcher (Int. J. Algebra Comput., 2022)

Verification of Automata with Storage Mechanisms. - Chris Köcher (TU Ilmenau, 2022)

Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. - Chris Köcher; Dietrich Kuske (FCT, 2023)

Regular Separators for VASS Coverability Languages. - Chris Köcher; Georg Zetzsche (FSTTCS, 2023)

The Power of Hard Attention Transformers on Data Sequences: A formal language theoretic perspective. - Pascal Bergsträßer; Chris Köcher; Anthony Widjaja Lin; Georg Zetzsche (NeurIPS, 2024)

The Complexity of Separability for Semilinear Sets and Parikh Automata. - Elias Rojas Collins; Chris Köcher; Georg Zetzsche (MFCS, 2025)

Backwards-reachability for cooperating multi-pushdown systems. - Chris Köcher; Dietrich Kuske (J. Comput. Syst. Sci., 2025)

Reachability in Trace-Pushdown Systems. - Chris Köcher; Dietrich Kuske (CoRR, 2025)

NoPE: The Counting Power of Transformers with No Positional Encodings. - Chris Köcher; Alexander Kozachinskiy; Anthony Widjaja Lin; Marco Sälzer; Georg Zetzsche (CoRR, 2025)