formalization of the pumping lemma for context-free languages
Clicks: 114
ID: 252315
2016
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Emerging Content
2.7
/100
9 views
9 readers
Trending
AI Quality Assessment
Not analyzed
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 | |
| Keywords |
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.