Christian Rauch

According to our database, Christian Rauch authored at least 12 papers between 2021 and 2023.

Collaborative distances:

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

2023

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case.

Markus Holzer, Christian Rauch

Int. J. Found. Comput. Sci., December, 2023

On Minimal Pumping Constants for Regular Languages.

Markus Holzer, Christian Rauch

Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

The Pumping Lemma for Regular Languages is Hard.

Hermann Gruber, Markus Holzer, Christian Rauch

Proceedings of the Implementation and Application of Automata, 2023

Computational Complexity of Reversible Reaction Systems.

Markus Holzer, Christian Rauch

Proceedings of the Reversible Computation - 15th International Conference, 2023

On Jaffe's Pumping Lemma, Revisited.

Markus Holzer, Christian Rauch

Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022

On the Accepting State Complexity of Operations on Permutation Automata.

Christian Rauch, Markus Holzer

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

On 25 Years of CIAA Through the Lens of Data Science.

Hermann Gruber, Markus Holzer, Christian Rauch

Proceedings of the Implementation and Application of Automata, 2022

On the Descriptional Complexity of the Direct Product of Finite Automata.

Markus Holzer, Christian Rauch

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract).

Markus Holzer, Christian Rauch

Proceedings of the Implementation and Application of Automata, 2021

The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract).

Markus Holzer, Christian Rauch

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

More on the Descriptional Complexity of Products of Finite Automata.

Markus Holzer, Christian Rauch

Proceedings of the Descriptional Complexity of Formal Systems, 2021

On the Computational Complexity of Reaction Systems, Revisited.

Markus Holzer, Christian Rauch

Proceedings of the Computer Science - Theory and Applications, 2021