Result Details

Self-Reproducing Pushdown Transducers

LORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. KYBERNETIKA, 2005, vol. 2005, no. 4, p. 533-539. ISSN: 0023-5954.
Type
journal article
Language
English
Authors
Lorenc Luboš, Ing., Ph.D., DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
Abstract

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 of thetranslation obtained from a self-reproducing pushdown transducer thatrepeats its translation no more than three times.

Keywords

pushdown transducer, self-reproducing pushdown transduction, recursively enumerable languages

Published
2005
Pages
533–539
Journal
KYBERNETIKA, vol. 2005, no. 4, ISSN 0023-5954
Book
Kybernetika
Place
Praha
BibTeX 
@article{BUT42911,
  author="Luboš {Lorenc} and Alexandr {Meduna}",
  title="Self-Reproducing Pushdown Transducers",
  journal="KYBERNETIKA",
  year="2005",
  volume="2005",
  number="4",
  pages="533--539",
  issn="0023-5954"
}
Projects
Optimally Integrated Models of Modern Information Technologies, GACR, Standardní projekty, GA201/04/0441, start: 2004-01-01, end: 2006-12-31, completed
Research groups
Formal Model Research Group (RG FM)
Departments
Department of Information Systems (DIFS)
Back to top