Detail publikace

Self-Reproducing Translation Made by Pushdown Transducers

LORENC, L., MEDUNA, A.

Originální název

Self-Reproducing Translation Made by Pushdown Transducers

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

After a translation of an input string, x, to an output string, y, a self-reproducing pushdown transducer can make a self-reproducing step during which it moves y to its input tape and translates it again. In this self-reproducing way, it can repeat the translation n-times for any n >= 1. This paper demonstrates that every recursively enumerable language can be characterized by the domain or the range of the translation obtained from a self-reproducing pushdown transducer that repeats its translation no more than three times.

Klíčová slova

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

Autoři

LORENC, L., MEDUNA, A.

Rok RIV

2005

Vydáno

14. 12. 2005

Nakladatel

Faculty of Informatics MU

Místo

Brno

Strany od

59

Strany do

67

Strany počet

9

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"
}