Abstract
We wish to use a given nondeterministic two-way multi-tape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for determining beforehand whether this transduction always results in a finite set of answers or not. We also develop an algorithm for evaluating these finite answers whenever the previous algorithm indicated their existence. Our algorithms can also be used for speeding up the simulation of these acceptors even when not used as transducers.
Cite
CITATION STYLE
Nykänen, M. (1999). Using acceptors as transducers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 133–148). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
