{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:28Z","timestamp":1725663268841},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:02:02Z","timestamp":1330185722000},"page":"444-450","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Tree language problems in pattern recognition theory"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Steinby","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"issue":"2","key":"43_CR1","first-page":"57","volume":"4","author":"K. Aoki","year":"1983","unstructured":"AOKI, K. and MAZUURA, K.: Syntax-directed least-errors analysis for context-free tree languages for syntactic pattern recognition. \u2014 Systems. Computers. Controls 4, no. 2 (1983), 57\u201365.","journal-title":"Systems. Computers. Controls"},{"issue":"6","key":"43_CR2","first-page":"10","volume":"4","author":"K. Aoki","year":"1983","unstructured":"AOKI, K. and MAZUURA, K.: A least-error recognizer for context-free tree languages on the Tai metric. \u2014 ibid  (1983), 10\u201318.","journal-title":"Systems. Computers. Controls"},{"key":"43_CR3","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TEC.1957.5222039","volume":"6","author":"D. D. Aufenkamp","year":"1957","unstructured":"AUFENKAMP, D.D. and HOHN, F.E.: Analysis of sequential machines. \u2014 IRE Trans. Electr. Comput. 6 (1957), 276\u2013285.","journal-title":"IRE Trans. Electr. Comput."},{"key":"43_CR4","first-page":"404","volume-title":"Minimization of deterministic tree grammars and automata","author":"A. Barrero","year":"1976","unstructured":"BARRERO, A. and GONZALEZ, R.C.: Minimization of deterministic tree grammars and automata. \u2014 Proc. IEEE Conf. Decision and Control and the 15th Symp. Adaptive Processes (Clearwater, Fla., 1976), Inst. Electr. Electron. Engrs., New York (1976), 404\u2013407."},{"key":"43_CR5","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TPAMI.1981.4767080","volume":"PAMI-3","author":"A. Barrero","year":"1981","unstructured":"BARRERO, A., GONZALEZ, R.C. and THOMASON, M.G.: Equivalence and reduction of expansive tree grammars. \u2014 IEEE Trans. Pattern Anal. & Mach. Intell. PAMI-3 (1981), 204\u2013206.","journal-title":"IEEE Trans. Pattern Anal. & Mach. Intell."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"BARRERO, A., THOMASON, M.G. and GONZALEZ, R.C.: Regular-like tree expressions. \u2014 Intern. J. Comput. Information Sci. 12 (1983).","DOI":"10.1007\/BF00996800"},{"key":"43_CR7","unstructured":"BERRY, G. and SETHI, R.: From regular expressions to deterministic automata. \u2014 INRIA Technical Report No. 649, Rocquencourt, France, 1987."},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","volume":"13","author":"W. S. Brainerd","year":"1968","unstructured":"BRAINERD, W.S.: The minimalization of tree automata. \u2014 Inform. Control 13 (1968), 484\u2013491.","journal-title":"Inform. Control"},{"key":"43_CR9","first-page":"293","volume":"SMC-7","author":"J. M. Brayer","year":"1977","unstructured":"BRAYER, J.M. and FU, K.-S.: A note on the k-tail method of tree grammar inference. \u2014 IEEE Trans. Systems Man Cybernetics SMC-7 (1977), 293\u2013300.","journal-title":"IEEE Trans. Systems Man Cybernetics"},{"key":"43_CR10","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. A. Brzozowski","year":"1964","unstructured":"BRZOZOWSKI, J.A.: Derivatives of regular expressions. \u2014 J. Assoc. Comput. Mach. 11 (1964), 481\u2013494.","journal-title":"J. Assoc. Comput. Mach."},{"key":"43_CR11","volume-title":"Tree automata and tree grammars. \u2014 DAIMI FN-10","author":"J. Engelfriet","year":"1975","unstructured":"ENGELFRIET, J.: Tree automata and tree grammars. \u2014 DAIMI FN-10, Inst. Math., Aarhus Univ., Aarhus, 1975."},{"key":"43_CR12","volume-title":"Syntactic pattern recognition and applications","author":"K.-S. Fu","year":"1982","unstructured":"FU, K.-S.: Syntactic pattern recognition and applications. \u2014 Prentice-Hall, Englewood Cliffs, N.J., 1982."},{"key":"43_CR13","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1109\/T-C.1973.223654","volume":"C-22","author":"K.-S. Fu","year":"1973","unstructured":"FU, K.-S. and BHARGAVA, B.K.: Tree systems for syntactic pattern recognition. \u2014 IEEE Trans. Computers C-22 (1973), 1087\u20131099.","journal-title":"IEEE Trans. Computers"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"FUKUDA, H. and KAMATA, K.: Inference of tree automata from sample set of trees. \u2014 Intern. J. Comput. Information Sci. 13 (1984).","DOI":"10.1007\/BF00979871"},{"key":"43_CR15","unstructured":"G\u00c9CSEG, F. and STEINBY, M.: Tree automata. \u2014 Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"43_CR16","volume-title":"Theorie der abstrakten Automaten","author":"V. M. Glushkow","year":"1963","unstructured":"GLUSHKOW, V.M.: Theorie der abstrakten Automaten. \u2014 VEB Deutscher Verlag der Wissenschaften, Berlin, 1963."},{"key":"43_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF00975630","volume":"5","author":"R. C. Gonzalez","year":"1976","unstructured":"GONZALEZ, R.C., EDWARDS, J.J. and THOMASON, M.G.: An algorithm for the inference of tree grammars. \u2014 Intern. J. Comput. Information Sci. 5 (1976), 145\u2013164.","journal-title":"Intern. J. Comput. Information Sci."},{"key":"43_CR18","volume-title":"Syntactic pattern recognition","author":"R. C. Gonzalez","year":"1978","unstructured":"GONZALEZ, R.C. and THOMASON, Syntactic pattern recognition. \u2014 Addison-Wesley, Reading, Mass., 1978."},{"key":"43_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01744582","volume":"16","author":"I. Guessarian","year":"1983","unstructured":"GUESSARIAN, I.: Pushdown tree automata. \u2014 Math. Systems Theory 16 (1983), 237\u2013263.","journal-title":"Math. Systems Theory"},{"key":"43_CR20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J. Hopcroft","year":"1971","unstructured":"HOPCROFT, J.: An nlogn algorithm for minimizing states in a finite automaton. \u2014 Theory of Machines and Computations (eds. Z. Kohavi and A. Paz), Academic Press, New York and London (1971), 189\u2013196."},{"key":"43_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TPAMI.1981.4767101","volume":"PAMI-3","author":"B. Levine","year":"1981","unstructured":"LEVINE, B.: Derivatives of tree sets with applications to grammatical inference. \u2014 IEEE Trans. Pattern Anal. Mach. Intell. PAMI-3 (1981), 285\u2013293.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TPAMI.1982.4767191","volume":"PAMI-4","author":"B. Levine","year":"1982","unstructured":"LEVINE, B.: The use of tree derivatives and a sample support parameter for inferring tree systems. \u2014 IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4 (1982), 25\u201334.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"43_CR23","unstructured":"MARCHAND, P.: Construction des alg\u00e8bres minimales des sous-ensembles des algebres libres. Applications aux reconnaissables. \u2014Les Arbres en Alg\u00e9bre et en Programmation, 4\u00e9me Coll. Lille, Lille (1979), 134\u2013158."},{"key":"43_CR24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"EC-9","author":"R. McNaughton","year":"1960","unstructured":"McNAUGHTON, R. and YAMADA, H.: Regular expression and state graphs for automata. \u2014 IRE Trans. Electron. Computers EC-9 (1960), 39\u201347.","journal-title":"IRE Trans. Electron. Computers"},{"key":"43_CR25","volume-title":"Structural methods in pattern recognition","author":"L. Miclet","year":"1986","unstructured":"MICLET, L.: Structural methods in pattern recognition. \u2014 North-Oxford, London, 1986."},{"key":"43_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W. C. Rounds","year":"1970","unstructured":"ROUNDS, W.C.: Mappings and grammars on trees. \u2014 Math. Systems Theory 4 (1970), 257\u2013287.","journal-title":"Math. Systems Theory"},{"key":"43_CR27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0022-0000(85)90002-9","volume":"30","author":"K. M. Schimpf","year":"1985","unstructured":"SCHIMPF, K.M. and GALLIER, J.H.: Tree pushdown automata. \u2014 J. Comput. Systems. Sci. 30 (1985), 25\u201340.","journal-title":"J. Comput. Systems. Sci."},{"key":"43_CR28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0019-9958(69)90017-5","volume":"14","author":"A. C. Shaw","year":"1969","unstructured":"SHAW, A.C.: The formal picture description scheme as a basis for picture processing systems. \u2014 Information Control 14 (1969), 9\u201352.","journal-title":"Information Control"},{"key":"43_CR29","unstructured":"STEINBY, M.: Syntactic algebras and varieties of recognizable sets. \u2014 Les Arbres en Alg\u00e9bre et en Programmation, 4\u00e9me Coll. Lille, Lille (1979), 226\u2013240."},{"key":"43_CR30","unstructured":"STEINBY, M.: On certain algebraically defined tree transformations. \u2014 Algebra, Combinatorics and Logic in Computer Science (Proc. Conf. Gy\u00f6r 1983), North-Holland, Amsterdam 1986, 745\u2013764."},{"key":"43_CR31","unstructured":"STEINBY, M.: Towards a formal theory of errors in pattern trees. \u2014 2nd Conf. Automata, Languages and Programming Systems (Salg\u00f3tarj\u00e1n, 1988), Department of Mathematics, K. Marx University of Economics, Budapest."},{"key":"43_CR32","unstructured":"STEINBY, M.: A formal theory of errors in tree representations of patterns, 4th Workshop on Mathematical Aspects of Computer Science (Magdeburg, 1988), to appear."},{"key":"43_CR33","first-page":"143","volume-title":"Currents in the Theory of Computing","author":"J. Thatcher","year":"1973","unstructured":"THATCHER, J.: Tree automata: an informal survey. \u2014 Currents in the Theory of Computing (ed. A. Aho), Prentice-Hall, Englewood-Cliffs, N.J., (1973), 143\u2013172."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:02:35Z","timestamp":1578517355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_43"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}