Definability Results for Top-Down Tree Transducers

Sebastian Maneth, Helmut Seidl, Martin Vu

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

2 Scopus citations

Abstract

We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1) by a linear top-down tree transducer or (2) by a tree homomorphism. We present algorithms that construct equivalent such transducers if they exist.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 25th International Conference, DLT 2021, Proceedings
EditorsNelma Moreira, Rogério Reis
PublisherSpringer Science and Business Media Deutschland GmbH
Pages291-303
Number of pages13
ISBN (Print)9783030815073
DOIs
StatePublished - 2021
Event25th International Conference on Developments in Language Theory, DLT 2021 - Virtual, Online
Duration: 16 Aug 202120 Aug 2021

Publication series

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

Conference

Conference25th International Conference on Developments in Language Theory, DLT 2021
CityVirtual, Online
Period16/08/2120/08/21

Fingerprint

Dive into the research topics of 'Definability Results for Top-Down Tree Transducers'. Together they form a unique fingerprint.

Cite this