| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952170 | Theoretical Computer Science | 2017 | 8 Pages |
Abstract
In this note we present a simple condition upon which a formal grammar produces a context-free language.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
M. Badano, D. Vaggione,