External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Pumping Lemma for Regular Languages is Hard

Hermann Gruber, Markus Holzer 0001, Christian Rauch. The Pumping Lemma for Regular Languages is Hard. In Benedek Nagy, editor, Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Volume 14151 of Lecture Notes in Computer Science, pages 128-140, Springer, 2023. [doi]

Authors

Hermann Gruber

This author has not been identified. Look up 'Hermann Gruber' in Google

Markus Holzer 0001

This author has not been identified. Look up 'Markus Holzer 0001' in Google

Christian Rauch

This author has not been identified. Look up 'Christian Rauch' in Google
runs on