{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:10:05Z","timestamp":1725466205899},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643418"},{"type":"electronic","value":"9783540697527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054002","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:55:04Z","timestamp":1149659704000},"page":"248-295","source":"Crossref","is-referenced-by-count":0,"title":["Recursive neural networks and automata"],"prefix":"10.1007","author":[{"given":"Marco","family":"Maggini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"issue":"no.3\/4","key":"10_CR1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/09540099308915703","volume":"5","author":"C. L. Giles","year":"1993","unstructured":"C. L. Giles and C. W. Omlin, \u201cExtraction, insertion and refinement of symbolic rules in dynamically-driven recurrent neural networks,\u201d Connection Science, vol. 5, no. 3\/4, p. 307, 1993. Special Issue on Architectures for Integrating Symbolic and Neural Processes.","journal-title":"Connection Science"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1162\/neco.1992.4.3.406","volume":"4","author":"R. L. Watrous","year":"1992","unstructured":"R. L. Watrous and G. M. Kuhn, \u201cInduction of finite-state languages using second-order recurrent networks,\u201d Neural Computation, vol. 4, pp. 406\u2013414, May 1992.","journal-title":"Neural Computation"},{"key":"10_CR3","first-page":"440","volume-title":"On the computational power of neural nets","author":"H. Siegelmann","year":"1992","unstructured":"H. Siegelmann and E. Sontag, \u201cOn the computational power of neural nets,\u201d in Proceedings of the Fifth ACM Workshop on Computational Learning Theory, (New York NY), pp. 440\u2013449, ACM, 1992."},{"key":"10_CR4","first-page":"5","volume":"23","author":"P. Frasconi","year":"1996","unstructured":"P. Frasconi, M. Gori, M. Maggini, and G. Soda, \u201cRepresentation of finite state automata in recurrent radial basis function networks,\u201d Machine Learning, vol. 23, pp. 5\u201332, 1996.","journal-title":"Machine Learning"},{"key":"10_CR5","first-page":"203","volume-title":"Recurrent networks: State machines or iterated function systems?","author":"J. F. Kolen","year":"1994","unstructured":"J. F. Kolen, \u201cRecurrent networks: State machines or iterated function systems?,\u201d in Proceedings of the 1993 Connectionist Models Summer School (M. C. Mozer, P. Smolensky, D. S. Touretzky, J. L. Elman, and A. S. Weigend, eds.), (Hillsdale NJ), pp. 203\u2013210, Erlbaum, 1994."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1109\/72.548181","volume":"7","author":"P. Frasconi","year":"1996","unstructured":"P. Frasconi and M. Gori, \u201cComputational capabilities of local-feedback recurrent networks acting as finite-state machines,\u201d IEEE Transactions on Neural Networks, vol. 7, pp. 1521\u20131525, November 1996.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"no.2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/3477.558801","volume":"27","author":"H. T. Siegelmann","year":"1997","unstructured":"H. T. Siegelmann, B. G. Horne, and C. L. Giles, \u201cComputational capabilities of recurrent narx neural networks,\u201d IEEE Trans. on Systems, Man and Cybernetics-Part B: Cybernetics, vol. 27, no. 2, p. 208, 1997.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics-Part B: Cybernetics"},{"issue":"no.6","key":"10_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0893-9659(91)90080-F","volume":"4","author":"H. Siegelmann","year":"1991","unstructured":"H. Siegelmann and E. Sontag, \u201cTuring computability with neural nets,\u201d Applied Mathematics Letters, vol. 4, no. 6, pp. 77\u201380, 1991.","journal-title":"Applied Mathematics Letters"},{"key":"10_CR9","first-page":"357","volume":"II","author":"G. Z. Sun","year":"1991","unstructured":"G. Z. Sun, H. H. Chen, Y. C. Lee, and C. L. Giles, \u201cTuring equivalence of neural networks with second order connection weights,\u201d in Proceedings of the International Joint Conference on Neural Networks, vol. II, pp. 357\u2013362, 1991.","journal-title":"Proceedings of the International Joint Conference on Neural Networks"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"W. S. McCulloch","year":"1943","unstructured":"W. S. McCulloch and W. Pitts, \u201cA logical calculus of ideas immanent in nervous activity,\u201d Bullettin of Mathematical Biophysics, vol. 5, pp. 115\u2013133, 1943.","journal-title":"Bullettin of Mathematical Biophysics"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. M. Gold","year":"1978","unstructured":"E. M. Gold, \u201cComplexity of automaton identification from given data,\u201d Information and Control, vol. 37, pp. 302\u2013320, 1978.","journal-title":"Information and Control"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/72.279181","volume":"5","author":"Y. Bengio","year":"1994","unstructured":"Y. Bengio, P. Frasconi, and P. Simard, \u201cLearning long-term dependencies with gradient descent is difficult,\u201d IEEE Transactions on Neural Networks, vol. 5, pp. 157\u2013166, March 1994. Special Issue on Dynamic Recurrent Neural Networks.","journal-title":"IEEE Transactions on Neural Networks"},{"unstructured":"M. F. Barnsley, Fractals Everywhere. Academic Press Professional, 1993. second edition.","key":"10_CR13"},{"key":"10_CR14","first-page":"363","volume-title":"Training second-order recurrent neural networks using hints","author":"C. W. Omlin","year":"1992","unstructured":"C. W. Omlin and C. L. Giles, \u201cTraining second-order recurrent neural networks using hints,\u201d in Proceedings of the Ninth International Conference on Machine Learning (D. Sleeman and P. Edwards, eds.), (San Mateo CA), pp. 363\u2013368, Morgan Kaufmann Publishers, 1992."},{"unstructured":"S. Das and M. C. Mozer, \u201cA unified gradient-descent\/clustering architecture for finite state machine induction,\u201d in Neural Information Processing Systems 6 (S. Cowan, G. Tesauro, and J. Alspector, eds.), pp. 19\u201326, 1994.","key":"10_CR15"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/72.279194","volume":"5","author":"Z. Zeng","year":"1994","unstructured":"Z. Zeng, R. Goodman, and P. Smyth, \u201cDiscrete recurrent neural networks for grammatical inference,\u201d IEEE Transactions on Neural Networks, vol. 5, pp. 320\u2013330, March 1994. Special Issue on Dynamic Recurrent Neural Networks.","journal-title":"IEEE Transactions on Neural Networks"},{"unstructured":"M. Gori, M. Maggini, and G. Soda, \u201cInductive inference from noisy examples: The rule-noise dilemma and the hybrid finite state filter,\u201d in Proceedings of ECAI96 Workshop 16 (Neural Networks and Structural Knowledge), (Budapest (Hungary)), pp. 53\u201358, August 1996.","key":"10_CR17"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold, \u201cLanguage identification in the limit,\u201d Information and Control, vol. 10, pp. 447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"10_CR19","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Reading MA: Addison-Wesley, 1979."},{"key":"10_CR20","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1978","unstructured":"Z. Kohavi, Switching and Finite Automata Theory. New York, NY: McGraw-Hill, Inc., 1978. second edition.","edition":"second edition"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","volume":"20","author":"J. Feldman","year":"1972","unstructured":"J. Feldman, \u201cSome decidability results on grammatical inference and complexity,\u201d Information and Control, vol. 20, pp. 244\u2013262, 1972.","journal-title":"Information and Control"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D. Angluin","year":"1978","unstructured":"D. Angluin, \u201cOn the complexity of minimum inference of regular sets,\u201d Information and Control, vol. 39, pp. 337\u2013350, 1978.","journal-title":"Information and Control"},{"key":"10_CR23","volume-title":"Finite Automata","author":"B. A. Trakhtenbrot","year":"1973","unstructured":"B. A. Trakhtenbrot and J. M. Barzdin, Finite Automata. Amsterdam: North-Holland, 1973."},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/TSMC.1975.5409159","volume":"SMC-5","author":"K. S. Fu","year":"1975","unstructured":"K. S. Fu and T. L. Booth, \u201cGrammatical inference: Introduction and survey \u2014 part I,\u201d IEEE Transactions on Systems, Man, and Cybernetics, vol. SMC-5, pp. 95\u2013111, January 1975.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"no.2\/3","key":"10_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1022642911489","volume":"7","author":"S. Porat","year":"1991","unstructured":"S. Porat and J. A. Feldman, \u201cLearning automata from ordered examples,\u201d Machine Learning, vol. 7, no. 2\/3, pp. 5\u201334, 1991. Special issue on Connectionist Approaches to Language Learning.","journal-title":"Machine Learning"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D. Angluin, \u201cInferring regular sets from queries and counterexamples,\u201d Information and Computation, vol. 75, pp. 87\u2013106, 1987.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"R. L. Rivest and R. E. Schapire, \u201cInference of finite automata using homing sequences,\u201d in Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, (Seattle, WA), pp. 411\u2013420, 1989.","key":"10_CR27","DOI":"10.1145\/73007.73047"},{"doi-asserted-by":"crossref","unstructured":"M. Tomita, \u201cDynamic construction of finite-state automata from examples using hill-climbing,\u201d in Proceedings of the Fourth Annual Cognitive Science Conference, (Ann Arbor MI), pp. 105\u2013108, 1982.","key":"10_CR28","DOI":"10.21236\/ADA120123"},{"unstructured":"J. R. Koza, Genetic Programming. MIT Press, 1992.","key":"10_CR29"},{"doi-asserted-by":"crossref","unstructured":"P. Frasconi, M. Gori, M. Maggini, and G. Soda, \u201cUnified integration of explicit rules and learning by example in recurrent networks,\u201d IEEE Transactions on Knowledge and Data Engineering, vol. 7, April 1995.","key":"10_CR30","DOI":"10.1109\/69.382304"},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0364-0213(90)90002-E","volume":"14","author":"J. L. Elman","year":"1990","unstructured":"J. L. Elman, \u201cFinding structure in time,\u201d Cognitive Sciences, vol. 14, pp. 179\u2013211, 1990.","journal-title":"Cognitive Sciences"},{"key":"10_CR32","volume-title":"Explorations in Parallel Distributed Processing","author":"J. L. McClelland","year":"1988","unstructured":"J. L. McClelland and D. E. Rumelhart, Explorations in Parallel Distributed Processing. Cambridge: MIT Press, 1988."},{"issue":"no.2\/3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1022647012398","volume":"7","author":"D. Servan-Schreiber","year":"1991","unstructured":"D. Servan-Schreiber, A. Cleeremans, and J. L. McClelland, \u201cGraded state machines: the representation of temporal contingencies in simple recurrent networks,\u201d Machine Learning, vol. 7, no. 2\/3, pp. 161\u2013194, 1991. Special issue on Connectionist Approaches to Language Learning.","journal-title":"Machine Learning"},{"issue":"no.3","key":"10_CR34","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1109\/72.286928","volume":"5","author":"M. W. Goudreau","year":"1994","unstructured":"M. W. Goudreau, C. L. Giles, S. T. Chakradhar, and D. Chen, \u201cFirst-order vs. second-order single layer recurrent neural networks,\u201d IEEE Transactions on Neural Networks, vol. 5, no. 3, p. 511, 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10_CR35","first-page":"32","volume-title":"Computation: Finite and Infinite Machines","author":"M. L. Minsky","year":"1967","unstructured":"M. L. Minsky, Computation: Finite and Infinite Machines, ch. 3, pp. 32\u201366. Englewood Cliffs (NJ): Prentice Hall, Inc., 1967."},{"issue":"no.6","key":"10_CR36","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0950-7051(96)81916-2","volume":"8","author":"P. Frasconi","year":"1995","unstructured":"P. Frasconi, M. Gori, and G. Soda, \u201cRecurrent neural networks and prior knowledge for sequence processing: a constrained nondeterministic approach,\u201d Knowledge Based Systems, vol. 8, no. 6, pp. 313\u2013332, 1995.","journal-title":"Knowledge Based Systems"},{"issue":"no.4","key":"10_CR37","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1142\/S0218001493000431","volume":"7","author":"C. B. Miller","year":"1993","unstructured":"C. B. Miller and C. L. Giles, \u201cExperimental comparison of the effect of order in recurrent neural networks,\u201d International Journal of Pattern Recognition and Artificial Intelligence, vol. 7, no. 4, pp. 849\u2013872, 1993. Special Issue on Applications of Neural Networks to Pattern Recognition.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"10_CR38","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1162\/neco.1994.6.6.1155","volume":"6","author":"P. Manolios","year":"1994","unstructured":"P. Manolios and R. Fanelli, \u201cFirst-order recurrent neural networks and deterministic finite state automata,\u201d Neural Computation, vol. 6, pp. 1155\u20131173, November 1994.","journal-title":"Neural Computation"},{"key":"10_CR39","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K. Hornik","year":"1989","unstructured":"K. Hornik, M. Stinchcombe, and H. White, \u201cMultilayer feedforward networks are universal approximators,\u201d Neural Networks, vol. 2, pp. 359\u2013366, 1989.","journal-title":"Neural Networks"},{"unstructured":"B. G. Horne and C. L. Giles, \u201cAn experimental comparison of recurrent neural networks,\u201d in Advances in Neural Information Processing Systems (G. Tesauro, D. Touretzky, and T. Leen, eds.), vol. 7, pp. 697\u2013704, The MIT Press, 1995.","key":"10_CR40"},{"issue":"no.1","key":"10_CR41","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1162\/neco.1992.4.1.120","volume":"4","author":"P. Frasconi","year":"1992","unstructured":"P. Frasconi, M. Gori, and G. Soda, \u201cLocal feedback multilayered networks,\u201d Neural Computation, vol. 4, no. 1, pp. 120\u2013130, 1992.","journal-title":"Neural Computation"},{"key":"10_CR42","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/72.279187","volume":"5","author":"A. C. Tsoi","year":"1994","unstructured":"A. C. Tsoi and A. D. Back, \u201cLocally recurrent globally feedforward networks: A critical review of architectures,\u201d IEEE Transactions on Neural Networks, vol. 5, pp. 229\u2013239, Mar. 1994.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0167-8655(92)90035-X","volume":"13","author":"B. Y. M. Gori","year":"1992","unstructured":"B. Y. M. Gori, and R. De Mori, \u201cLearning the dynamic nature of speech with back-propagation for sequences,\u201d Pattern Recognition Letters, vol. 13, pp. 375\u2013385, May 1992. Special issue on Artificial Neural Networks.","journal-title":"Pattern Recognition Letters"},{"issue":"no.1","key":"10_CR44","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/72.80202","volume":"1","author":"K. Narendra","year":"1990","unstructured":"K. Narendra and K. Parthasarathy, \u201cIdentification and control of dynamical systems using neural networks,\u201d IEEE Transactions on Neural Networks, vol. 1, no. 1, pp. 4\u201327, 1990.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10_CR45","volume-title":"Tech. Rep. UMIACS-TR-94-94 and CS-TR-3328","author":"C. L. Giles","year":"1994","unstructured":"C. L. Giles, B. G. Horne, and T. Lin, \u201cLearning a class of large finite stste machines with a recurrent neural network,\u201d Tech. Rep. UMIACS-TR-94-94 and CS-TR-3328, Institute for Advanced Computer Studies, University of Maryland, College Park MD, August 1994."},{"doi-asserted-by":"crossref","unstructured":"C. W. Omlin and C. L. Giles, \u201cConstructing deterministic finite-state automata in sparse recurrent neural networks,\u201d in Proceedings of the IEEE International Conference on Neural Networks (ICNN'94), pp. 1732\u20131737, 1994.","key":"10_CR46","DOI":"10.1109\/ICNN.1994.374417"},{"issue":"no.2\/3","key":"10_CR47","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1023\/A:1022651113306","volume":"7","author":"J. B. Pollack","year":"1991","unstructured":"J. B. Pollack, \u201cThe induction of dynamical recognizers,\u201d Machine Learning, vol. 7, no. 2\/3, pp. 196\u2013227, 1991. Special issue on Connectionist Approaches to Language Learning.","journal-title":"Machine Learning"},{"key":"10_CR48","first-page":"317","volume":"4","author":"R. L. Watrous","year":"1992","unstructured":"R. L. Watrous and G. M. Kuhn, \u201cInduction of finite-state automata using second-order recurrent networks,\u201d in Advances in Neural Information Processing Systems 4, pp. 317\u2013324, 1992.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"10_CR49","first-page":"317","volume-title":"Advances in Neural Information Processing Systems 4","author":"C. L. Giles","year":"1992","unstructured":"C. L. Giles, C. B. Miller, D. Chen, G. Z. S. H. H. Chen, and Y. C. Lee, \u201cExtracting and learning an unknown grammar with recurrent neural networks,\u201d in Advances in Neural Information Processing Systems 4 (J. Moody, S. Hanson, and R. Lippmann, eds.), (San Mateo CA), pp. 317\u2013324, Morgan Kauffmann Publishers, 1992."},{"issue":"no.3","key":"10_CR50","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","volume":"4","author":"C. L. Giles","year":"1992","unstructured":"C. L. Giles, C. B. Miller, D. Chen, G. Z. Sun, H. H. Chen, and Y. C. Lee, \u201cLearning and extracting finite state automata with second-order recurrent neural networks,\u201d Neural Computation, vol. 4, no. 3, pp. 393\u2013405, 1992.","journal-title":"Neural Computation"},{"key":"10_CR51","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1109\/ICNN.1993.298658","volume":"II","author":"C. L. Giles","year":"1993","unstructured":"C. L. Giles and C. W. Omlin, \u201cRule refinement with recurrent neural networks,\u201d in Proceedings of the IEEE International Conference on Neural Networks (ICNN'93), vol. II, pp. 801\u2013806, 1993.","journal-title":"Proceedings of the IEEE International Conference on Neural Networks (ICNN'93)"},{"issue":"no.5","key":"10_CR52","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1162\/neco.1995.7.5.923","volume":"7","author":"M. Forcada","year":"1995","unstructured":"M. Forcada and R. Carrasco, \u201cLearning the initial state of a second order recurrent neural network during regular-language inference,\u201d Neural Computation, vol. 7, no. 5, pp. 923\u2013930, 1995.","journal-title":"Neural Computation"},{"issue":"no.6","key":"10_CR53","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1162\/neco.1993.5.6.976","volume":"5","author":"Z. Zeng","year":"1993","unstructured":"Z. Zeng, R. Goodman, and P. Smyth, \u201cLearning finite state machines with self-clustering recurrent networks,\u201d Neural Computation, vol. 5, no. 6, pp. 976\u2013990, 1993.","journal-title":"Neural Computation"},{"issue":"no.6","key":"10_CR54","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1162\/neco.1996.8.6.1135","volume":"8","author":"M. Casey","year":"1996","unstructured":"M. Casey, \u201cThe dynamics of discrete-time computation, with the application to recurrent neural networks and finite state machine extraction,\u201d Neural Computation, vol. 8, no. 6, pp. 1135\u20131178, 1996.","journal-title":"Neural Computation"},{"key":"10_CR55","first-page":"149","volume":"18","author":"D. Ron","year":"1995","unstructured":"D. Ron and R. Rubinfeld, \u201cLearning fallible deterministic finite automata,\u201d Machine Learning, vol. 18, pp. 149\u2013185, 1995.","journal-title":"Machine Learning"},{"unstructured":"M. Gori, M. Maggini, and G. Soda, \u201cLearning regular grammars from noisy examples using recurrent neural networks,\u201d in Proceedings of the NEURAP 96, (Marseille (France)), pp. 207\u2013214, March 20\u201322 1996.","key":"10_CR56"},{"doi-asserted-by":"crossref","unstructured":"R. C. Carrasco and M. L. Forcada, \u201cSecond-order recurrent neural networks can learn regular grammars from noisy strings.,\u201d in From Natural to Artificial Neural Computatiion: Proceedings of IWANN'95 (June 7\u20139, 1995). (J. Mira and F. Sandoval, eds.), vol. 930 of Lecture Notes in Computer Science, pp. 605\u2013610, Springer-Verlag, 1995.","key":"10_CR57","DOI":"10.1007\/3-540-59497-3_228"},{"unstructured":"J. Thatcher, \u201cTree automata: An informal survey,\u201d in Current Trends in the Theory of Computing (A. Aho, ed.), pp. 143\u2013172, Prentice-Hall, Inc., 1973.","key":"10_CR58"}],"container-title":["Lecture Notes in Computer Science","Adaptive Processing of Sequences and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T06:35:57Z","timestamp":1555655757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643418","9783540697527"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/bfb0054002","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}