Abstract
Synchronized tree automata allow limited communication between computations in independent subtrees of the input. This enables them to verify, for instance, the equality of two unary subtrees of unlimited size. The class of tree languages recognized by synchronized tree automata is strictly included in the context-free tree languages. As our main result we show that equivalence of tree languages recognized by deterministic synchronized tree automata can be effectively decided. This contrasts the earlier undecidability result for the equivalence problem for nondeterministic synchronized tree automata.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, in: Proc. of the 9th Symposium on Theoretical Aspects of Computer Science, Lect. Notes Comput. Sci. 577, Springer-Verlag, 1992, pp. 161–171.
A.-C. Caron, J.-L. Coquidé and M. Dauchet, Encompassment properties and automata with constraints, in: Proc. of 5th RTA, Lect. Notes Comput. Sci. 690, Springer-Verlag, 1993, pp. 328–342.
A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet and F. Jacquemard, Pumping, cleaning and symbolic constraints solving, in: Proc. of 21st ICALP, Lect. Notes Comput. Sci. 820, Springer-Verlag, 1994, pp. 436–449.
Z. Fülöp and S. Vágvölgyi, Variants of top-down tree transducers with look-ahead, Math. Systems Theory 21 (1989) 125–145.
Z. Fülöp and S. Vágvölgyi, Iterated deterministic top-down look-ahead, in: Proc. of 7th FCT, Lect. Notes Comput. Sci. 380, Springer-Verlag, 1989, pp. 175–184.
Z. Fülöp and S. Vágvölgyi, A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata, Fundam. Inf. 13 (1990) 211–226.
F. Gécseg and M. Steinby, Tree automata, Akadémiai Kiadó, Budapest, 1984.
T. Harju and J. Karhumäki, The equivalence problem of multitape finite automata, Theoret. Comput. Sci. 78 (1991) 347–355.
J. Hromkovič, How to organize the communication among parallel processes in alternating computations, unpublished manuscript, Comenius University, Bratislava, 1986.
J. Hromkovič, J. Karhumäki, B. Rovan and A. Slobodová, On the power of synchronization in parallel computations, Discrete Appl. Math. 32 (1991) 155–182.
J. Hromkovič, B. Rovan, A. Slobodová, Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoret. Comput. Sci. 132 (1994) 319–336.
O. Ibarra and N. Trân, Synchronized finite automata and 2DFA reductions, Theoret. Comput. Sci. 115 (1993) 261–275.
K. Salomaa, Yield-languages recognized by alternating tree recognizers, RAIRO Inform. Théor. 22 (1988) 319–339.
K. Salomaa, Synchronized tree automata, Theoret. Comput. Sci. 127 (1994) 25–51.
G. Slutzki, Alternating tree automata, Theoret. Comput. Sci. 41 (1985) 305–318.
G. Slutzki and S. Vágvölgyi, A hierarchy of deterministic top-down tree transformations, in: Proc. of 9th FCT, Lect. Notes Comput. Sci. 710, Springer-Verlag, 1993, pp. 440–451.
S. Vágvölgyi, Top-down tree transducers with two-way tree walking look-ahead, Theoret. Comput. Sci. 93 (1992) 43–74.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salomaa, K. (1995). Decidability of equivalence for deterministic synchronized tree automata. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_192
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_192
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive