<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Marcus V. M. Ramos</style></author><author><style face="normal" font="default" size="100%">José Bacelar Almeida</style></author><author><style face="normal" font="default" size="100%">Nelma Moreira</style></author><author><style face="normal" font="default" size="100%">Ruy J. G. B. de Queiroz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Formalization of the Pumping Lemma for Context-Free Languages</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Formalized Reasoning</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://jfr.unibo.it/article/view/5595</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jba/files/16jfr.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">University of Bolonha</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">53-68</style></pages><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Context-free languages are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">2</style></issue></record></records></xml>