Christian Rauch

Available identifiers

Publication	Date of Publication	Type
On pumping preserving homomorphisms and the complexity of the pumping problem (extended abstract)	2025-01-20	Paper
On Minimal Pumping Constants for Regular Languages	2024-04-09	Paper
The pumping lemma for regular languages is hard	2024-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q6190441	2024-02-06	Paper
On the accepting state complexity of operations on permutation automata	2024-02-02	Paper
Computational complexity of reversible reaction systems	2024-01-11	Paper
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case	2023-11-24	Paper
On Jaffe's pumping lemma, revisited	2023-08-17	Paper
On the descriptional complexity of the direct product of finite automata	2023-01-18	Paper
More on the descriptional complexity of products of finite automata	2022-11-09	Paper
On 25 years of CIAA through the lens of data science	2022-08-16	Paper
The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract)	2022-03-25	Paper
The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract)	2022-03-22	Paper
On the computational complexity of reaction systems, revisited	2022-03-21	Paper

This page was built for person: Christian Rauch