Detail výsledku

On Elimination of Erasing Rules from E0S Grammars

HAVEL, M.; MEDUNA, A. On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova, 2022, vol. 30, no. 2, p. 135-147. ISSN: 1561-4042.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Havel Martin, Ing.
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Abstrakt

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.

Klíčová slova

formal languages, E0S grammars, elimination of erasing rules

URL
Rok
2022
Strany
135–147
Časopis
Computer Science Journal of Moldova, roč. 30, č. 2, ISSN 1561-4042
DOI
10.56415/csjm.v30.08
UT WoS
000825309600001
EID Scopus
2-s2.0-85134572166
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/"
}
Projekty
IT4Innovations excellence in science, MŠMT, Národní program udržitelnosti II, LQ1602, zahájení: 2016-01-01, ukončení: 2020-12-31, ukončen
Výzkumné skupiny
Výzkumná skupina formálních modelů (VZ FM)
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru