Detail výsledku

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.
Typ
článek ve sborníku konference
Jazyk
anglicky
Autoři
Křivka Zbyněk, Ing., Ph.D., UIFS (FIT)
Abstrakt

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.

Klíčová slova

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

Rok
2005
Strany
139–144
Sborník
PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Konference
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science -- MEMICS 2005
Vydavatel
Faculty of Informatics MU
Místo
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"
}
Projekty
Optimally Integrated Models of Modern Information Technologies, GAČR, Standardní projekty, GA201/04/0441, zahájení: 2004-01-01, ukončení: 2006-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