2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.FL2023★ 2 cited
On Minimal Pumping Constants for Regular Languages
Markus Holzer, Christian Rauch
The study of the operational complexity of minimal pumping constants started in [J. DASSOW and I. JECKER. Operational complexity and pumping lemmas. Acta Inform., 59:337-355, 2022]…
cs.FL2022★ 2 cited
On the Accepting State Complexity of Operations on Permutation Automata
Christian Rauch, Markus Holzer
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to languages accepted by p…