Publication detail

On Elimination of Erasing Rules from E0S Grammars

HAVEL, M. MEDUNA, A.

Original Title

On Elimination of Erasing Rules from E0S Grammars

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

formal languages, E0S grammars, elimination of erasing rules

Authors

HAVEL, M.; MEDUNA, A.

Released

14. 7. 2022

ISBN

1561-4042

Periodical

Computer Science Journal of Moldova

Year of study

30

Number

2

State

Republic of Moldova

Pages from

135

Pages to

147

Pages count

13

URL

http://www.math.md/publications/csjm/issues/v30-n2/

BibTex

@article{BUT179363,
  author="Martin {Havel} and Alexandr {Meduna}",
  title="On Elimination of Erasing Rules from E0S Grammars",
  journal="Computer Science Journal of Moldova",
  year="2022",
  volume="30",
  number="2",
  pages="135--147",
  doi="10.56415/csjm.v30.08",
  issn="1561-4042",
  url="http://www.math.md/publications/csjm/issues/v30-n2/"
}