Abstract
It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Inform. and Control 19, 439–475 (1971)
Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comp. Syst. Sci. 61, 1–50 (2000)
Courcelle, B., Franchi-Zannettacci, P.: On the equivalence problem for attribute systems. Inform. and Control 52, 275–305 (1982)
Culik II, K., Karhumäki, J.: The equivalence problem for single-valued two-way transducers (on NPDT0L languages) is decidable. SIAM J. Comput. 16, 221–230 (1987)
Courcelle, B.: Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci. 126, 53–75 (1994)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of graph grammars and computing by graph transformation, vol. 1, pp. 313–400. World Scientific, Singapore (1997)
Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and twoway finite-state transducers. ACM Transactions on Computational Logic 2, 216–254 (2001)
Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154, 34–91 (1999)
Engelfriet, J., Maneth, S.: A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39, 613–698 (2003)
Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32, 950–1006 (2003)
Engelfriet, J.: Some open questions and recent results on tree transducers and tree languages. In: Formal language theory; perspectives and open problems, Academic Press, London (1980)
Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, ch. 3, Springer, Heidelberg (1997)
Engelfriet, J., Rozenberg, G., Slutzki, G.: Tree transducers, L systems, and two-way machines. J. Comp. Syst. Sci. 20, 150–202 (1980)
Ésik, Z.: Decidability results concerning tree transducers I. Acta Cybern. 5, 1–20 (1980)
Fülöp, Z., Vogler, H.: Syntax-Directed Semantics – Formal Models based on Tree Transducers. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) EATCS Monographs in Theoretical Computer Science, Springer, Heidelberg (1998)
Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)
Griffiths, T.V.: The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines. J. ACM 15, 409–413 (1968)
Ginsburg, S., Spanier, E.H.: Bounded Algol-like languages. Trans. Amer. Math. Soc. 113, 333–368 (1964)
Gurari, E.M.: The equivalence problem for deterministic two-way sequential transducers is decidable. SIAM J. Comput. 11(3), 448–452 (1982)
Ibarra, O.H.: 2DST mappings on languages and related problems. Theoret. Comput. Sci. 19, 219–227 (1982)
Maneth, S.: The macro tree transducer hierarchy collapses for functions of linear size increase. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 326–337. Springer, Heidelberg (2002)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: Proc. PODS 2005, pp. 283–294. ACM Press, New York (2005)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comp. Syst. Sci. 66, 66–97 (2003)
Parikh, R.J.: On context-free languages. J. ACM 13, 570–581 (1966)
Zachar, Z.: The solvability of the equivalence problem for deterministic frontier-toroot tree transducers. Acta Cybern. 4, 167–177 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelfriet, J., Maneth, S. (2005). The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_40
Download citation
DOI: https://doi.org/10.1007/11590156_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)