When is a functional tree transduction deterministic?

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationTAPSOFT 1993
Subtitle of host publicationTheory and Practice of Software Development - 4th International Joint Conference CAAP/FASE, Proceedings
EditorsMarie-Claude Gaudel, Jean-Pierre Jouannaud
PublisherSpringer Verlag
Pages251-265
Number of pages15
ISBN (Print)9783540566106
DOIs
StatePublished - 1993
Externally publishedYes
Event4th International Joint Conference on the Theory and Practice of Software Development, TAPSOFT 1993 - Orsay, France
Duration: 13 Apr 199317 Apr 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume668 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Joint Conference on the Theory and Practice of Software Development, TAPSOFT 1993
Country/TerritoryFrance
CityOrsay
Period13/04/9317/04/93

Fingerprint

Dive into the research topics of 'When is a functional tree transduction deterministic?'. Together they form a unique fingerprint.

Cite this