On Elimination of Erasing Rules from E0S Grammars

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F22%3APU145733" target="_blank" >RIV/00216305:26230/22:PU145733 - isvavai.cz</a>
Result on the web
<a href="http://www.math.md/publications/csjm/issues/v30-n2/" target="_blank" >http://www.math.md/publications/csjm/issues/v30-n2/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.56415/csjm.v30.08" target="_blank" >10.56415/csjm.v30.08</a>

Result language
angličtina
Original language name
On Elimination of Erasing Rules from E0S Grammars
Original language description
The present paper describes an alternative algorithm for the removal of erasing rules from E0S grammars. As opposed to the standard way of eliminating erasing rules in most E0S-like grammars, such as context-free grammars, this method requires no predetermination of symbols that derive the empty string. The proposed algorithm is formally verified. In the conclusion of the paper, the applicability of the algorithm to E0S grammars that work in a semi-parallel way is demonstrated. Furthermore, two open problems are formulated.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)