{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:11:21Z","timestamp":1794381081716,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_78","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"932-944","source":"Crossref","is-referenced-by-count":6,"title":["Property Testing of Regular Tree Languages"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Magniez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"de Rougemont","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"78_CR1","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica\u00a020, 451\u2013476 (2000)","journal-title":"Combinatorica"},{"key":"78_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Krivelich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM Journal on Computing 30(6) (2000)","DOI":"10.1137\/S0097539700366528"},{"issue":"1","key":"78_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. Journal of the ACM\u00a042(1), 269\u2013291 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"78_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. Journal of Computer and System Sciences\u00a047(3), 549\u2013595 (1993)","journal-title":"Journal of Computer and System Sciences"},{"key":"78_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-45726-7_3","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"H. Chockler","year":"2002","unstructured":"Chockler, H., Kupferman, O.: \u03c9-regular languages are testable with a constant number of queries. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, pp. 26\u201338. Springer, Heidelberg (2002)"},{"key":"78_CR6","unstructured":"Cormode, G.: Sequence Distance Embeddings. PhD thesis, University of Warwick (2003)"},{"issue":"4","key":"78_CR7","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"issue":"6","key":"78_CR8","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1137\/S0097539796298625","volume":"28","author":"R. Rubinfeld","year":"1999","unstructured":"Rubinfeld, R.: On the robustness of functional equations. SIAM Journal on Computing\u00a028(6), 1972\u20131997 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"78_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing\u00a025(2), 23\u201332 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"78_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K. Tai","year":"1979","unstructured":"Tai, K.: The tree-to-tree correction problem. Journal of the ACM\u00a026, 422\u2013433 (1979)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T16:28:58Z","timestamp":1553099338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_78","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b99859","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}