The complexity of the exponential output size problem for top-down and bottom-up tree transducers

Information and Computation

Volumn 169, Issue 2, 2001, Pages 264-283

  Drewes, Frank ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

Completeness; Complexity; Output size; Tree transducer

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

TREE TRANSDUCER;

TREES (MATHEMATICS);

EID: 0035885989     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.3039     Document Type: Article

References (18)

1. Aho, A. V., and Ullman, J. D. (1971), Translations on a context free grammar, Inform. and Control, 19, 439-475.
2. Drewes, F. (1998), "TREEBAG-A Tree-Based Generator for Objects of Various Types." Report 1/98, University of Bremen.
3. Drewes, F. (1999), The complexity of the exponential output size problem for top-down tree transducers, in "Proc. Fundamentals of Computation Theory (FCT'99)," Iaşi. Romania (G. Ciobanu and Gh. Paun. Eds.), Lecture Notes in Computer Science, Vol. 1684, pp. 234-245, Springer-Verlag, Berlin/New York.
4. Engelfriet, J. (1980), Some open questions and recent results on tree transducers and tree languages, in "Formal Language Theory: Perspectives and Open Problems" (R. V. Book, Ed.), pp, 241-286. Academic Press, New York.
5. Engelfriet, J. (1982), Three hierarchies of transducers, Math. Systems Theory 15, 95-125.
6. Engelfriet, J., and Maneth, S. (2000), Characterizing and deciding MSO-definability of macro tree transductions, in "Proc. 17th Annual Symposium on the Theoretical Aspects of Computer Science (STACS'00)," Lille, France (H. Reichel and S. Tison, Eds.). Lecture Notes in Computer Science. Vol. 1770, pp. 542-554, Springer-Verlag, Berlin.
7. Engelfriet, J., and Vogler, H. (1985), Macro tree transducers, J. Comput. System Sci. 31, 71-146.
8. Fülöp, Z., and Vogler, H. (1998), "Syntax-Directed Semantics: Formal Models Based on Tree Transducers," Springer-Verlag, Berlin.
9. Gécseg, F., and Steinby, M. (1997), Tree languages, in "Handbook of Formal Languages. Vol. III: Beyond Words." Chap. 1. pp. 1-68, Springer-Verlag, Berlin.
10. Immerman, N. (1988), Nondeterministic space is closed under complement. SIAM J. Comput. 17, 935-938.
11. Jones, N. D., and Laaser, W. T. (1977), Complete problems for deterministic polynomial time. Theoret. Comput. Sci. 3, 105-117.
12. Papadimitriou, C. H. (1994), "Computational Complexity." Addison-Wesley, Reading, MA.
13. Rounds, W. C. (1970), Mappings and grammars on trees, Math. Systems Theory 4, 257-287.
14. Seidl, H. (1994), Haskell overloading is DEXPTIME-complete, Inform. Process. Lett. 52(2), 57-60.
15. Szelepcsényi, R. (1988), The method of forced enumeration for nondeterministic automata. Acta Inform. 26, 279-284.
16. 2 sequential machine maps. J. Comput. System Sci. 4, 339-367.
17. Thatcher, J. W. (1970), There's a lot more to finite automata theory than you would have thought, in "Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems," pp. 263-276. Revised version published as [18].
18. Thatcher, J. W. (1973), Tree automata: An informal survey, in "Currents in the Theory of Computing," pp. 143-172, Prentice Hall, New York.