On the Computational Complexity of Reaction Systems, Revisited. - Markus Holzer 001; Christian Rauch 001 (CSR, 2021)

More on the Descriptional Complexity of Products of Finite Automata. - Markus Holzer 001; Christian Rauch 001 (DCFS, 2021)

The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract). - Markus Holzer 001; Christian Rauch 001 (DLT, 2021)

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract). - Markus Holzer 001; Christian Rauch 001 (CIAA, 2021)

On the Descriptional Complexity of the Direct Product of Finite Automata. - Markus Holzer 001; Christian Rauch 001 (DCFS, 2022)

On 25 Years of CIAA Through the Lens of Data Science. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2022)

On the Accepting State Complexity of Operations on Permutation Automata. - Christian Rauch 001; Markus Holzer 001 (NCMA, 2022)

On Jaffe's Pumping Lemma, Revisited. - Markus Holzer 001; Christian Rauch 001 (DCFS, 2023)

Computational Complexity of Reversible Reaction Systems. - Markus Holzer 001; Christian Rauch 001 (RC, 2023)

The Pumping Lemma for Regular Languages is Hard. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2023)

On Minimal Pumping Constants for Regular Languages. - Markus Holzer 001; Christian Rauch 001 (AFL, 2023)

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case. - Markus Holzer 001; Christian Rauch 001 (Int. J. Found. Comput. Sci., 2023)

The Pumping Lemma for Context-Free Languages is Undecidable. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (DLT, 2024)

On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (CIAA, 2024)

On Pumping Problems for Unary Regular Languages. - Hermann Gruber; Markus Holzer 001; Christian Rauch 001 (SOFSEM (2), 2025)

More on Language Families with a Decidable Pumping-Problem (Extended Abstract). - Markus Holzer 001; Christian Rauch 001 (CIAA, 2025)