A short survey around the pumping lemma for context-free languages
Abstract: Following a seminar the present author gave to an Automata Theory course to computer science students, it will be presented, in a very synthetic and mostly selfcontained way, the principal properties of context free languages (CFL), with particular attention given to the Pumping Lemma (PL), and of grammars which generate them(CFG). We refer to Chomsky and Schutzenberger for the first works about it. What is known in literature as the Iteration Theorem here will be referred to as the Ogden's Lemma in a fully justified way. All definitions not strictly connected with the notion of context freeness will be omitted (we will give precise references for all of them). The symbology used is substantially the classical one, but we will replace some symbols to avoid confusion with those used in logic
- Autebert, J-M. - Berstel, J - Boasson, L. : “Context-Free Languages and Pushdown Automata”, cap. 3, vol. 1 del “Handbook of Formal Languages”, Rozemberg-Salomaa Ed. per Springer, 1997;
- Bar Hillel, Y - Perles, M - Shamir, E : “On Formal Properties of Simple Phrase Structure Grammars”, Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung, 1961;
- Berstel, J - Boasson, L. : “Context-Free Languages”, cap. 2 del “Handbook of Theoretical Computer Science”, J. van Leeuwen Ed., 1990;
- Chomsky, N. : “On Certain Formal Properties of Grammars”, Information and Control 2, 1959;
- Chomsky, N. - Schützenberger,M.P. : “The Algebraic Theory of Context-Free Languages”, in “Computer Programming and Formal Languages”, Braffort-Hirschberg Ed. per North Holland, 1963;
- De Luca, A - D’Alessandro, F. : “Teoria degli Automi Finiti”, Springer Ed., 2013;
- Harrison, M : “Introduction to Formal Language Theory”, Addison-Wesley Ed., 1978;
- Hopcroft, J.E. - Ullman, J.D. : “Introduction To Automata Theory”, Addison-Wesley Ed., 1979;
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.