Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikačního výsledku
LORENC, L.; MEDUNA, A.
Originální název
Self-Reproducing Translation Made by Pushdown Transducers
Anglický název
Druh
Stať ve sborníku mimo WoS a Scopus
Originální 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.
Anglický abstrakt
Klíčová slova
pushdown transducer, self-reproducing pushdown transducer, queue grammar, left-extended queue grammar, translation
Klíčová slova v angličtině
Autoři
Vydáno
14.12.2005
Nakladatel
Faculty of Informatics MU
Místo
Brno
Kniha
PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
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" }