| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 180 1 |
| Ultima descărcare din IBN: 2023-03-13 13:28 |
| Căutarea după subiecte similare conform CZU |
| 004.91 (38) |
| Informatică aplicată. Tehnici bazate pe calculator cu aplicații practice (438) |
 SM ISO690:2012MEDUNA, Alexander, HAVEL, Martin. On Elimination of Erasing Rules from E0S Grammars. In: Computer Science Journal of Moldova, 2022, nr. 2(89), pp. 135-147. ISSN 1561-4042. DOI: https://doi.org/10.56415/csjm.v30.08 |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 2(89) / 2022 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| DOI:https://doi.org/10.56415/csjm.v30.08 | ||||||
| CZU: 004.91 | ||||||
| MSC 2010: 68Q45, 03D05, 68Q70. | ||||||
| Pag. 135-147 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
The present paper describes an alternative algorithm for the removal of erasing rules fromE0S 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. |
||||||
| Cuvinte-cheie Formal languages, E0S grammars, elimination of erasing rules |
||||||
|
|
|
|
