On Jaffe's pumping lemma, revisited

DOI10.1007/978-3-031-34326-1_5OpenAlexW4381855730MaRDI QIDQ6175088

Christian Rauch, Markus Holzer

Publication date: 17 August 2023

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34326-1_5

zbMATH Keywords

finite automataregular languagesdescriptional complexityfinite-state devicesJaffe's pumping lemma

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

The pumping lemma for regular languages is hard ⋮ On Minimal Pumping Constants for Regular Languages

Cites Work

• A note on the pumping lemma for regular languages
• More on the descriptional complexity of products of finite automata
• Operational complexity and pumping lemmas
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Jaffe's pumping lemma, revisited