The pumping lemma for regular languages is hard

DOI10.1007/978-3-031-40247-0_9OpenAlexW4385711117MaRDI QIDQ6199869

Christian Rauch, Hermann Gruber, Markus Holzer

Publication date: 28 February 2024

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-40247-0_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• Which problems have strongly exponential complexity?
• Operational complexity and pumping lemmas
• Relationships between nondeterministic and deterministic tape complexities
• Inference of Reversible Languages
• On Jaffe's pumping lemma, revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The pumping lemma for regular languages is hard