Detail výsledku

Self-Reproducing Translation Made by Pushdown Transducers

LORENC, L.; MEDUNA, A. Self-Reproducing Translation Made by Pushdown Transducers. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005. p. 59.
Typ
článek ve sborníku konference
Jazyk
angličtina
Autoři
Lorenc Luboš, Ing., Ph.D., FIT (FIT), UIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., UIFS (FIT)
Abstrakt

After a translation of an input string, x, to an output string, y, aself-reproducing pushdown transducer can make a self-reproducing stepduring which it moves y to its input tape and translates it again. Inthis self-reproducing way, it can repeat the translation n-times forany n >= 1. This paper demonstrates that every recursivelyenumerable language can be characterized by the domain or the range ofthe translation obtained from a self-reproducing pushdown transducerthat repeats its translation no more than three times.

Klíčová slova

pushdown transducer, self-reproducing pushdown transducer, queue grammar, left-extended queue grammar, translation

Rok
2005
Strany
59–67
Sborník
PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
Vydavatel
Faculty of Informatics MU
Místo
Brno
BibTeX 
@inproceedings{BUT18055,
  author="Luboš {Lorenc} and Alexandr {Meduna}",
  title="Self-Reproducing Translation Made by Pushdown Transducers",
  booktitle="PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science",
  year="2005",
  pages="59--67",
  publisher="Faculty of Informatics MU",
  address="Brno"
}
Projekty
Integrovaný přístup k výchově studentů DSP v oblasti paralelních a distribuovaných systémů, GAČR, Doktorské granty, GD102/05/H050, zahájení: 2005-01-01, ukončení: 2008-12-31, ukončen
Pracoviště
Ústav informačních systémů (UIFS)
Nahoru