On Minimal Pumping Constants for Regular Languages

DOI10.4204/EPTCS.386.11MaRDI QIDQ6204130zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Christian Rauch

Publication date 9 April 2024

Published in Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2309.02757

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3856413 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3617584 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1033559 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• On Jaffe's pumping lemma, revisited
• Operational complexity and pumping lemmas

Cited in

(2)

• On Jaffe's pumping lemma, revisited
• The pumping lemma for context-free languages is undecidable

This page was built for publication: On Minimal Pumping Constants for Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204130)