Chris Köcher

According to our database, Chris Köcher authored at least 10 papers between 2017 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Regular Separators for VASS Coverability Languages.

Chris Köcher, Georg Zetzsche

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems.

Chris Köcher, Dietrich Kuske

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Verification of Automata with Storage Mechanisms.

Chris Köcher

PhD thesis, 2022

Rational, recognizable, and aperiodic partially lossy queue languages.

Chris Köcher

Int. J. Algebra Comput., 2022

2021

Reachability Problems on Reliable and Lossy Queue Automata.

Chris Köcher

Theory Comput. Syst., 2021

2019

Reachability Problems on Partially Lossy Queue Automata.

Chris Köcher

Proceedings of the Reachability Problems - 13th International Conference, 2019

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

Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid.

Chris Köcher

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

The Cayley-Graph of the Queue Monoid: Logic and Decidability.

Faried Abu Zaid, Chris Köcher

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

The Transformation Monoid of a Partially Lossy Queue.

Chris Köcher, Dietrich Kuske

Proceedings of the Computer Science - Theory and Applications, 2017