Result Details

Recursive Erasing in Programmed Grammars

KŘIVKA, Z. Recursive Erasing in Programmed Grammars. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Faculty of Informatics MU, 2005. p. 139-144.
Type
conference paper
Language
English
Authors
Křivka Zbyněk, Ing., Ph.D., DIFS (FIT)
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

Published
2005
Pages
139–144
Proceedings
PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Conference
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science -- MEMICS 2005
Publisher
Faculty of Informatics MU
Place
Znojmo
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"
}
Projects
Optimally Integrated Models of Modern Information Technologies, GACR, Standardní projekty, GA201/04/0441, start: 2004-01-01, end: 2006-12-31, completed
Research groups
Formal Model Research Group (RG FM)
Departments
Department of Information Systems (DIFS)
Back to top