Publication detail

Recursive Erasing in Programmed Grammars

KŘIVKA, Z.

Original Title

Recursive Erasing in Programmed Grammars

Type

conference paper

Language

English

Original Abstract

This paper removes some erasing productions in regulated grammars.
We consider programmed grammars with appearance checking containing erasing productions that generate the family of recursively enumerable language.
We place some condition on productions, called recursively nonterminal-erasing set.
Then we remove all erasing productions satisfying given condition in such a grammar.
There are also sketched some specialization and properties of the condition and practical aspects at the conclusion.

Keywords

recursive erasing, programmed grammar, appearance checking, erasing production, regulated rewriting, recursively nonterminal-erasing set of productions

Authors

KŘIVKA, Z.

RIV year

2005

Released

14. 10. 2005

Publisher

Faculty of Informatics MU

Location

Znojmo

Pages from

139

Pages to

144

Pages count

6

BibTex

@inproceedings{BUT18274,
  author="Zbyněk {Křivka}",
  title="Recursive Erasing in Programmed Grammars",
  booktitle="PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2005",
  pages="139--144",
  publisher="Faculty of Informatics MU",
  address="Znojmo"
}