{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:14:12Z","timestamp":1752228852470},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647768"},{"type":"electronic","value":"9783540687078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054070","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T14:54:16Z","timestamp":1152197656000},"page":"126-137","source":"Crossref","is-referenced-by-count":7,"title":["A stochastic search approach to grammar induction"],"prefix":"10.1007","author":[{"given":"Hugues","family":"Juill\u00e9","sequence":"first","affiliation":[]},{"given":"Jordan B.","family":"Pollack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,23]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Dana Angluin and Carl H. Smith. Inductive inference: Theory and methods. Computing Surveys, 15:237\u2013269, September 1983.","journal-title":"Computing Surveys"},{"key":"12_CR2","first-page":"2","volume-title":"A survey of evolution strategies","author":"T. B\u00c4ck","year":"1991","unstructured":"Thomas B\u00c4ck, Frank Hoffmeister, and Hans-Paul Schwefel. A survey of evolution strategies. In Richard K. Belew and Lashon B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 2\u20139, San Mateo, California, 1991. Morgan Kaufmann."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/0221022","volume":"21","author":"P. C. Chen","year":"1992","unstructured":"Pang C. Chen. Heuristic sampling: a method for predicting the performance of tree searching programs. SIAM Journal on Computing, 21:295\u2013315, april 1992.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR4","first-page":"19","volume":"6","author":"S. Das","year":"1994","unstructured":"S. Das and M. C. Mozer. A unified gradient-descent\/clustering architecture for finite state machine induction. In Neural Information Processing Systems, volume 6, pages 19\u201326, 1994.","journal-title":"Neural Information Processing Systems"},{"key":"12_CR5","first-page":"14","volume":"4","author":"L. J. Fogel","year":"1962","unstructured":"Lawrence J. Fogel. Autonomous automata. Industrial Research, 4:14\u201319, 1962.","journal-title":"Industrial Research"},{"issue":"5","key":"12_CR6","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1162\/neco.1995.7.5.923","volume":"7","author":"M. L. Forcada","year":"1995","unstructured":"M. L. Forcada and R. C. Carrasco. Learning the initial state of a second-order recurrent neural network during regular-language inference. Neural Computation, 7(5):923\u2013930, 1995.","journal-title":"Neural Computation"},{"key":"12_CR7","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. Mark Gold. Complexity of automaton identification from given data. Information and Control, 37:302\u2013320, 1978.","journal-title":"Information and Control"},{"key":"12_CR8","unstructured":"David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989."},{"key":"12_CR9","volume-title":"Evolution of non-deterministic incremental algorithms as a new approach for search in state spaces","author":"H. Juill\u00e9","year":"1995","unstructured":"Hugues Juill\u00e9. Evolution of non-deterministic incremental algorithms as a new approach for search in state spaces. In Larry J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, San Mateo, California, 1995. Morgan Kaufmann."},{"key":"12_CR10","unstructured":"Hugues Juill\u00e9 and Jordan B. Pollack. Sage: a sampling-based heuristic for tree search. 1998. Submitted to Machine Learning."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.2307\/2005469","volume":"29","author":"D. E. Knuth","year":"1975","unstructured":"Donald E. Knuth. Estimating the efficiency of backtracking programs. Math. Comp., 29:121\u2013136, 1975.","journal-title":"Math. Comp."},{"key":"12_CR12","unstructured":"John R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kevin J. Lang. Random dfa's can be approximately learned from sparse uniform examples. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pages 45\u201352, 1992.","DOI":"10.1145\/130385.130390"},{"key":"12_CR14","unstructured":"Kevin J. Lang and Barak A. Pearlmutter. Abbadingo one: Dfa learning competition. http:\/\/abba-dingo.cs.unm.edu, 1997."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Kevin J. Lang, Barak A. Pearlmutter, and Rodney Price. Results of the abbadingo one dfa learning competition and a new evidence driven state merging algorithm. 1998. Submitted to Machine Learning.","DOI":"10.1007\/BFb0054059"},{"key":"12_CR16","first-page":"227","volume":"7","author":"J. B. Pollack","year":"1991","unstructured":"Jordan B. Pollack. The induction of dynamical recognizers. Machine Learning, 7:227\u2013252, 1991.","journal-title":"Machine Learning"},{"key":"12_CR17","unstructured":"B. A. Trakhtenbrot and Ya M. Barzdin. Finite Automata: Behavior and Synthesis. North Holland Publishing Company, 1973."},{"issue":"3","key":"12_CR18","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. Induction of finite state languages using second-order recurrent networks. Neural Computation, 4(3):406\u2013414, 1992.","journal-title":"Neural Computation"},{"issue":"6","key":"12_CR19","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1162\/neco.1993.5.6.976","volume":"5","author":"Z. Zeng","year":"1994","unstructured":"Z. Zeng, R. M. Goodman, and P. Smyth. Learning finite state machines with self-clustering recurrent networks. Neural Computation, 5(6):976\u2013990, 1994.","journal-title":"Neural Computation"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T21:21:32Z","timestamp":1555708892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0054070"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647768","9783540687078"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0054070","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}