{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:36Z","timestamp":1725664476109},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_192","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:13:51Z","timestamp":1330276431000},"page":"140-154","source":"Crossref","is-referenced-by-count":1,"title":["Decidability of equivalence for deterministic synchronized tree automata"],"prefix":"10.1007","author":[{"given":"Kai","family":"Salomaa","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013171.","DOI":"10.1007\/3-540-55210-3_181"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"A.-C. Caron, J.-L. Coquid\u00e9 and M. Dauchet, Encompassment properties and automata with constraints, in: Proc. of 5th RTA, Lect. Notes Comput. Sci. 690, Springer-Verlag, 1993, pp. 328\u2013342.","DOI":"10.1007\/3-540-56868-9_25"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"A.-C. Caron, H. Comon, J.-L. Coquid\u00e9, 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\u2013449.","DOI":"10.1007\/3-540-58201-0_88"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02088010","volume":"21","author":"Z. F\u00fcl\u00f6p","year":"1989","unstructured":"Z. F\u00fcl\u00f6p and S. V\u00e1gv\u00f6lgyi, Variants of top-down tree transducers with look-ahead, Math. Systems Theory\n                21 (1989) 125\u2013145.","journal-title":"Math. Systems Theory"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Z. F\u00fcl\u00f6p and S. V\u00e1gv\u00f6lgyi, Iterated deterministic top-down look-ahead, in: Proc. of 7th FCT, Lect. Notes Comput. Sci. 380, Springer-Verlag, 1989, pp. 175\u2013184.","DOI":"10.1007\/3-540-51498-8_17"},{"key":"9_CR6","first-page":"211","volume":"13","author":"Z. F\u00fcl\u00f6p","year":"1990","unstructured":"Z. F\u00fcl\u00f6p and S. V\u00e1gv\u00f6lgyi, A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata, Fundam. Inf.\n                13 (1990) 211\u2013226.","journal-title":"Fundam. Inf."},{"key":"9_CR7","unstructured":"F. G\u00e9cseg and M. Steinby, Tree automata, Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"T. Harju and J. Karhum\u00e4ki, The equivalence problem of multitape finite automata, Theoret. Comput. Sci.\n                78 (1991) 347\u2013355.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR9","volume-title":"How to organize the communication among parallel processes in alternating computations","author":"J. Hromkovi\u010d","year":"1986","unstructured":"J. Hromkovi\u010d, How to organize the communication among parallel processes in alternating computations, unpublished manuscript, Comenius University, Bratislava, 1986."},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(91)90098-H","volume":"32","author":"J. Hromkovi\u010d","year":"1991","unstructured":"J. Hromkovi\u010d, J. Karhum\u00e4ki, B. Rovan and A. Slobodov\u00e1, On the power of synchronization in parallel computations, Discrete Appl. Math.\n                32 (1991) 155\u2013182.","journal-title":"Discrete Appl. Math."},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0304-3975(94)90238-0","volume":"132","author":"J. Hromkovi\u010d","year":"1994","unstructured":"J. Hromkovi\u010d, B. Rovan, A. Slobodov\u00e1, Deterministic versus nondeterministic space in terms of synchronized alternating machines, Theoret. Comput. Sci.\n                132 (1994) 319\u2013336.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(93)90119-E","volume":"115","author":"O. Ibarra","year":"1993","unstructured":"O. Ibarra and N. Tr\u00e2n, Synchronized finite automata and 2DFA reductions, Theoret. Comput. Sci.\n                115 (1993) 261\u2013275.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1051\/ita\/1988220303191","volume":"22","author":"K. Salomaa","year":"1988","unstructured":"K. Salomaa, Yield-languages recognized by alternating tree recognizers, RAIRO Inform. Th\u00e9or.\n                22 (1988) 319\u2013339.","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(94)90099-X","volume":"127","author":"K. Salomaa","year":"1994","unstructured":"K. Salomaa, Synchronized tree automata, Theoret. Comput. Sci.\n                127 (1994) 25\u201351.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(85)90077-5","volume":"41","author":"G. Slutzki","year":"1985","unstructured":"G. Slutzki, Alternating tree automata, Theoret. Comput. Sci.\n                41 (1985) 305\u2013318.","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"G. Slutzki and S. V\u00e1gv\u00f6lgyi, A hierarchy of deterministic top-down tree transformations, in: Proc. of 9th FCT, Lect. Notes Comput. Sci. 710, Springer-Verlag, 1993, pp. 440\u2013451.","DOI":"10.1007\/3-540-57163-9_38"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(92)90211-W","volume":"93","author":"S. V\u00e1gv\u00f6lgyi","year":"1992","unstructured":"S. V\u00e1gv\u00f6lgyi, Top-down tree transducers with two-way tree walking look-ahead, Theoret. Comput. Sci.\n                93 (1992) 43\u201374.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_192.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:59Z","timestamp":1619573219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_192","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}