TY - GEN
T1 - When is a functional tree transduction deterministic?
AU - Seidl, Helmut
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - We give a decision procedure to determine whether or not the transduction of a functional transducer can be realized by a deterministic (resp. reduced deterministic) transducer. In case this is possible we exhibit a general construction to build this transducer.
AB - We give a decision procedure to determine whether or not the transduction of a functional transducer can be realized by a deterministic (resp. reduced deterministic) transducer. In case this is possible we exhibit a general construction to build this transducer.
UR - http://www.scopus.com/inward/record.url?scp=85029516081&partnerID=8YFLogxK
U2 - 10.1007/3-540-56610-4_69
DO - 10.1007/3-540-56610-4_69
M3 - Conference contribution
AN - SCOPUS:85029516081
SN - 9783540566106
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 251
EP - 265
BT - TAPSOFT 1993
A2 - Gaudel, Marie-Claude
A2 - Jouannaud, Jean-Pierre
PB - Springer Verlag
T2 - 4th International Joint Conference on the Theory and Practice of Software Development, TAPSOFT 1993
Y2 - 13 April 1993 through 17 April 1993
ER -