Self-reproducing pushdown transducers
Kybernetika, Tome 41 (2005) no. 4, p. [531]
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
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 \ge 1$. This paper demonstrates that every recursively enumerable language can be characterized by the domain of the translation obtained from a self- reproducing pushdown transducer that repeats its translation no more than three times.
Classification :
68Q45
Keywords: pushdown transducer; self-reproducing pushdown transduction; recursively enumerable languages
Keywords: pushdown transducer; self-reproducing pushdown transduction; recursively enumerable languages
@article{KYB_2005__41_4_a6,
author = {Meduna, Alexander and Lorenc, Lubo\v{s}},
title = {Self-reproducing pushdown transducers},
journal = {Kybernetika},
pages = {[531]},
publisher = {mathdoc},
volume = {41},
number = {4},
year = {2005},
mrnumber = {2180361},
zbl = {1249.68104},
language = {en},
url = {http://geodesic.mathdoc.fr/item/KYB_2005__41_4_a6/}
}
Meduna, Alexander; Lorenc, Luboš. Self-reproducing pushdown transducers. Kybernetika, Tome 41 (2005) no. 4, p. [531]. http://geodesic.mathdoc.fr/item/KYB_2005__41_4_a6/