Decidability of the finiteness of ranges of tree transductions
type: Item
instance of: scholarly article
title: Decidability of the finiteness of ranges of tree transductions
zbMATH Open document ID: 1034.68525
author: Frank Drewes
author: Joost Engelfriet
published in: Information and Computation
publication date: 2002-11-24T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1220695
zbMATH Keywords: TBY\({}^+\)definable sets
zbMATH Keywords: TBY\({}^+\)computable relations
MaRDI profile type: Publication
OpenAlex ID: W1965983776
cites work: Decidability of equivalence for a class of non-deterministic tree transducers
cites work: Translations on a context free grammar
cites work: Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
cites work: Tree transducers and tree languages
cites work: Composition of top-down and bottom-up tree transductions
cites work: Q4767250
cites work: Attribute grammars and recursive program schemes. I. II
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: The IO- and OI-hierarchies
cites work: Superlinear deterministic top-down tree transducers
cites work: An automata-theoretical characterization of the OI-hierarchy
cites work: Language theoretic and algorithmic properties of \(d\)-dimensional collages and patterns in a grid
cites work: Q4890711
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Q4954439
cites work: Top-down tree transducers with regular look-ahead
cites work: On tree transducers for partial functions
cites work: Three hierarchies of transducers
cites work: Iterated stack automata and complexity classes
cites work: IO and OI. I
cites work: IO and OI. II
cites work: Macro tree transducers
cites work: High level tree transducers and iterated pushdown tree transducers
cites work: Top-down tree transducers with deterministic top-down look-ahead
cites work: Q3323279
cites work: Q4179852
cites work: Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
cites work: Hyperedge replacement: grammars and languages
cites work: On derivation trees of indexed grammars - an extension of the uvwxy- theorem
cites work: Q4711083
cites work: Q5592246
cites work: Complexity of some problems concerningL systems
cites work: A generalized approach to formal languages
cites work: Algebraic automata and context-free sets
cites work: Q5573961
cites work: Mappings and grammars on trees
cites work: Q5678435
cites work: Equivalence of finite-valued tree transducers is decidable
cites work: Finite tree automata with cost functions
cites work: Deterministic top-down tree transducers with iterated look-ahead
cites work: Generalized sequential machine maps
cites work: The OI-hierarchy is closed under control
cites work: Q4061986
cites work: On the decidability of certain integer subgraph problems on context-free graph languages
DOI: 10.1006/INCO.1998.2715
description: scientific article; zbMATH DE number 1220695