Christian Rauch

19 papers C 8Misc 1Journal 4Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
On Jaffe's pumping lemma, revisited.
Inf. Comput.
Markus Holzer, Christian Rauch
2026 J jnl
The Pumping Lemma for Regular Languages is Hard.
Int. J. Found. Comput. Sci.
Hermann Gruber, Markus Holzer, Christian Rauch
2025 C conf
More on Language Families with a Decidable Pumping-Problem (Extended Abstract).
CIAA
Markus Holzer, Christian Rauch
2025 — conf
On Pumping Problems for Unary Regular Languages.
SOFSEM (2)
Hermann Gruber, Markus Holzer, Christian Rauch
2024 C conf
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract).
CIAA
Hermann Gruber, Markus Holzer, Christian Rauch
2024 C conf
The Pumping Lemma for Context-Free Languages is Undecidable.
DLT
Hermann Gruber, Markus Holzer, Christian Rauch
2023 C conf
Computational Complexity of Reversible Reaction Systems.
RC
Markus Holzer, Christian Rauch
2023 — conf
On Jaffe's Pumping Lemma, Revisited.
DCFS
Markus Holzer, Christian Rauch
2023 — conf
On Minimal Pumping Constants for Regular Languages.
AFL
Markus Holzer, Christian Rauch
2023 J jnl
On the accepting state complexity of operations on permutation automata.
RAIRO Theor. Informatics Appl.
Christian Rauch, Markus Holzer
2023 C conf
The Pumping Lemma for Regular Languages is Hard.
CIAA
Hermann Gruber, Markus Holzer, Christian Rauch
2023 J jnl
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case.
Int. J. Found. Comput. Sci.
Markus Holzer, Christian Rauch
2022 C conf
On 25 Years of CIAA Through the Lens of Data Science.
CIAA
Hermann Gruber, Markus Holzer, Christian Rauch
2022 — conf
On the Accepting State Complexity of Operations on Permutation Automata.
NCMA
Christian Rauch, Markus Holzer
2022 — conf
On the Descriptional Complexity of the Direct Product of Finite Automata.
DCFS
Markus Holzer, Christian Rauch
2021 — conf
More on the Descriptional Complexity of Products of Finite Automata.
DCFS
Markus Holzer, Christian Rauch
2021 Misc conf
On the Computational Complexity of Reaction Systems, Revisited.
CSR
Markus Holzer, Christian Rauch
2021 C conf
The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract).
DLT
Markus Holzer, Christian Rauch
2021 C conf
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract).
CIAA
Markus Holzer, Christian Rauch