formalization of the pumping lemma for context-free languages

Clicks: 187
ID: 252315
2016
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #11 of 13 articles by views in journal of clinical psychopharmacology

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
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.
Reference Key
ramos2016journalformalization Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Marcus V M Ramos;José Carlos Bacelar Almeida;Nelma Moreira;Ruy José Guerra Barretto de Queiroz
Journal journal of clinical psychopharmacology
Year 2016
DOI
10.6092/issn.1972-5787/5595
URL
https://jfr.unibo.it/article/view/5595
Keywords
computer scienceanalytic mechanics

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.