Frank Drewes, Joost Engelfriet  Home/Search
Context Related
Links: ACM DBLP | informatik.unibremen.de/~drewe...fi.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wi.leidenuniv.nl/home/c...pubyear (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The finiteness of ranges of tree transductions is shown to be decidable for TBY + , the composition closure of macro tree transductions. Furthermore, TBY + definable sets and TBY + computable relations are considered, which are obtained by viewing a tree as an expression that denotes an element of a given algebra. A sufficient condition on the considered algebra is formulated under which the finiteness problem is decidable for TBY + definable sets and for the ranges of TBY +... (Update)
Context of citations to this paper: More
.... This is decidable, because finiteness of the range of a composition of MTT R s, restricted to a regular tree language K,is decidable [DE98]. ii) It is straightforward to construct an MTT R M # with input alphabet # # q (1) q # Q and output alphabet # # Ym (for an...
...under deterministic generalized sequential machine (GSM) mappings. For the case of nondeterministic MTTs it is shown in Theorem 6. 3 of [DE98] that the class of string languages generated by them is closed under nondeterministic GSM mappings. We are now ready to prove that...
Cited by: More
Two-Way Finite State Transducers with Nested Pebbles - Engelfriet, Maneth (Correct)
Appligraph: Applications of Graph Transformation - First.. - Kreowski, Plump, (eds.) (1998) (Correct)
Appligraph: Applications of Graph Transformation - Second.. - Kreowski, (eds.) (1999) (Correct)
Active bibliography (related documents): More All
1.6: Branching Synchronization Grammars with Nested Tables - Drewes, Engelfriet (2002) (Correct)
1.3: The Delta Operation: - From Strings To (Correct)
1.1: A Characterization of the Sets of Hypertrees Generated by.. - Drewes (1997) (Correct)
Similar documents based on text: More All
0.9: Output String Languages of Compositions of Deterministic.. - Engelfriet, Maneth (2001) (Correct)
0.6: Iteration of Rational Transductions - Simplot, Terlutte (1998) (Correct)
0.6: Iterated Length-Preserving Rational Transductions.. - Latteux, Simplot.. (1998) (Correct)
Related documents from co-citation: More All
8: and twoway machines (context) - Engelfriet, Rozenberg et al. - 1980
6: Macro tree transducers (context) - Engelfriet, Vogler - 1985
6: IO and OI (context) - Engelfriet, Schmidt - 1977
BibTeX entry: (Update)
Frank Drewes and Joost Engelfriet. Decidability of the finiteness of ranges of tree transductions. Report 9/96, Univ. Bremen, 1996. Revised version to appear in Information and Computation. http://citeseer.ist.psu.edu/drewes96decidability.html More
@article{ drewes98decidability,
author = "Frank Drewes and Joost Engelfriet",
title = "Decidability of the Finiteness of Ranges of Tree Transductions",
journal = "Information and Computation",
volume = "145",
number = "1",
pages = "1-50",
year = "1998",
url = "citeseer.ist.psu.edu/drewes96decidability.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
220 Formal Languages (context) - Salomaa - 1973 ACM
113 Akad'emiai Kiad'o (context) - G'ecseg, Steinby - 1984
51 Monadic second order evaluations on treedecomposable graphs (context) - Courcelle, Mosbah - 1993
50 Macro tree transducers (context) - Engelfriet, Vogler - 1985 DBLP
46 Theory of Recursive Functions and Effective Computability (context) - Rogers - 1987
46 Translations on a context free grammar (context) - Aho, Ullman - 1971 ACM DBLP
44 Algebraic automata and context-free sets (context) - Mezei, Wright - 1967 DBLP
44 Tree automata: an informal survey (context) - Thatcher - 1973
39 Generalized 2 sequential machine maps (context) - Thatcher - 1970
38 Attribute grammars and recursive program schemes (context) - Courcelle, Franchi-Zannettacci - 1982
31 Bottom-up and top-down tree transformations---a comparison (context) - Engelfriet - 1975
31 Some open questions and recent results on tree transducers a.. (context) - Engelfriet - 1980
30 Top-down tree transducers with regular look-ahead (context) - Engelfriet - 1977 DBLP
28 IO and OI (context) - Engelfriet, Schmidt - 1978
28 IO and OI (context) - Engelfriet, Schmidt - 1977
24 Three hierarchies of transducers (context) - Engelfriet - 1982 DBLP
22 volume 643 of Lecture Notes in Computer Science (context) - Habel, Grammars - 1992
18 Graph grammars and tree transducers - Engelfriet - 1994 ACM DBLP
17 Mathematical Systems Theory (context) - Rounds, grammars - 1970 ACM
15 Computation by tree transductions (context) - Drewes - 1996
15 Grammars with macro-like productions (context) - Fischer - 1968 DBLP
14 High level tree transducers and iterated pushdown tree trans.. (context) - Engelfriet, Vogler - 1988 ACM DBLP
14 Finite tree automata with cost functions (context) - Seidl - 1994 ACM DBLP
14 Tree languages (context) - G'ecseg, Steinby - 1997 ACM
13 Generalized syntax directed translation (context) - Baker - 1978
13 Language theoretic and algorithmic properties of d-dimension.. (context) - Drewes - 1996 DBLP
11 Deterministic top-down tree transducers with iterated look-a.. - Slutzki, V'agvolgyi - 1995 ACM
10 Composition of top-down and bottom-up tree transductions (context) - Baker - 1979 DBLP
9 Decidable boundedness problems for sets of graphs generated .. (context) - Habel, Kreowski et al. - 1991 ACM DBLP
8 Tree-oriented proofs of some theorems on context-free and in.. (context) - Rounds - 1970 ACM DBLP
7 On tree transducers for partial functions (context) - Engelfriet - 1978 DBLP
7 Complexity of some problems concerning L systems (context) - Jones, Skyum - 1979 ACM DBLP
7 A lower bound on the growth of functions computed by tree tr.. (context) - Drewes - 1996 ACM DBLP
7 There's a lot more to finite automata theory than you would .. (context) - Thatcher - 1970
6 Decidability of equivalence for a class of nondeterministic .. - Andr'e, Dauchet - 1994
6 Information and Control (context) - Baker, tree - 1978
6 A generalized approach to formal languages (context) - Maibaum - 1974 DBLP
5 Theoretical Computer Science (context) - Damm, OI-hierarchies - 1982 ACM
5 Iterated stack automata and complexity classes (context) - Engelfriet - 1991 ACM DBLP
4 Variants of top-down tree transducers with look-ahead (context) - Fulop, V'agvolgyi - 1989 DBLP
4 and regular look-ahead tree transformations (context) - Gyenizse, V'agvolgyi et al. - 1996
3 On derivation trees of indexed grammars - an extension of th.. (context) - Hayashi - 1973
2 the decidability of certain integer subgraph problems on con.. (context) - Wanke - 1994
2 An algebraic formulation of the Chomsky hierarchy (context) - Wand - 1975
2 An automata-theoretical characterization of the OI-hierarchy (context) - Damm, Goerdt - 1986 ACM DBLP
1 Equivalence of finite-valued tree transducers is decidable (context) - Seidl - 1994 ACM DBLP
1 Algebraic theory of feedback in discrete systems (context) - Buchi - 1966
1 Mathematical foundations of formal language theory (context) - Wand - 1973
1 The IO-hierarchy is closed under control (context) - Vogler - 1988
1 Superlinear deterministic top-down tree transducers (context) - D'anyi, Fulop - 1996 DBLP
1 Lecture Notes DAIMI FN (context) - Engelfriet, tree - 1975
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC