RO EN
On Elimination of Erasing Rules from E0S Grammars
Authors: Alexander Meduna, Martin Havel
Keywords: Formal languages, E0S grammars, elimination of erasing rules.
– 0.10 Mb
Keywords: Formal languages, E0S grammars, elimination of erasing rules.
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.Faculty of Information Technology, Brno University of Technology
Božetěchova 1/2, 612 66 Brno, Czech Republic
E-mail: ,
Božetěchova 1/2, 612 66 Brno, Czech Republic
E-mail: ,
DOI
https://doi.org/10.56415/csjm.v30.08Fulltext
– 0.10 Mb
Contents
- On Elimination of Erasing Rules from E0S Grammars
- Vehicle Detection from Unmanned Aerial Images with Deep Mask R-CNN
- Identities and generalized derivatives of quasigroups
- Degree of favoring in apportionments
- Quadruplet loss and SqueezeNets for Covid-19 detection from Chest-X ray
- The Domination Parameters on a kind of the regular honeycomb structure
- Split logarithm problem and a candidate for a post-quantum signature scheme
- A Comparative study on classification performance of Emphysema with transfer learning methods in deep convolutional neural networks
- Svetlana Cojocaru - 70th anniversary
