W. Brauer (1984):
Automatentheorie: Eine Einführung in die Theorie endlicher Automaten.
Leitfäden und Monographien der Informatik.
Teubner Stuttgart,
doi:10.1007/978-3-322-92151-2.
(in German).
J. Dassow & I. Jecker (2022):
Operational complexity and pumping lemmas.
Acta Inform. 59,
pp. 337––355,
doi:10.1007/s00236-022-00431-3.
H. Gruber, M. Holzer & C. Rauch (2023):
The Pumping Lemma for Regular Languages is Hard.
In: B. Nagy: Proceedings of the 27th International Conference on Implementation and Application of Automata,
LNCS 14151.
Springer,
Famagusta, Cyprus.
Accepted for publication.
M. A. Harrison (1978):
Introduction to Formal Language Theory.
Addison-Wesley.
M. Holzer & C. Rauch (2023):
On Jaffe’s Pumping Lemma, Revisited.
In: H. Bordihn, N. Tran & G. Vaszil: Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems,
LNCS 13918.
Springer,
Potsdam, Germany,
pp. 65–78,
doi:10.1007/978-3-031-34326-1_5.
J. E. Hopcroft & J. D. Ullman (1979):
Introduction to Automata Theory, Languages and Computation.
Addison-Wesley.
J. Jaffe (1978):
A necessary and sufficient pumping lemma for regular languages.
SIGACT News 10(2),
pp. 48–49,
doi:10.1145/990524.990528.
D. C. Kozen (1997):
Automata and Computability.
Undergraduate Texts in Computer Science.
Springer,
doi:10.1007/978-1-4612-1844-9.
A. Nijholt (1982):
YABBER—Yet Another Bibliography: Pumping Lemma's. An Annotated Bibliography of Pumping.
Bull. EATCS 17,
pp. 34–53.
M. O. Rabin & D. Scott (1959):
Finite Automata and Their Decision Problems.
IBM J. Res. Dev. 3,
pp. 114–125,
doi:10.1147/rd.32.0114.
W. J. Savitch (1982):
Abstract Machines and Grammars.
Little, Brown and Company.
eptcs@eptcs.org