Christian Rauch

Publication Activity (10 Years)

Years Active: 2023-2024
Publications (10 Years): 7

Top Topics

Johnson Lindenstrauss

Finite Automata

Regular Languages

Top Venues

Int. J. Found. Comput. Sci.

Publications

Hermann Gruber, Markus Holzer, Christian Rauch
The Pumping Lemma for Context-Free Languages is Undecidable. DLT (2024)
Christian Rauch, Markus Holzer
On the accepting state complexity of operations on permutation automata. RAIRO Theor. Informatics Appl. 57 (2023)
Markus Holzer, Christian Rauch
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. Int. J. Found. Comput. Sci. 34 (8) (2023)
Markus Holzer, Christian Rauch
On Jaffe's Pumping Lemma, Revisited. DCFS (2023)
Markus Holzer, Christian Rauch
On Minimal Pumping Constants for Regular Languages. AFL (2023)
Hermann Gruber, Markus Holzer, Christian Rauch
The Pumping Lemma for Regular Languages is Hard. CIAA (2023)
Markus Holzer, Christian Rauch
Computational Complexity of Reversible Reaction Systems. RC (2023)