{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:57Z","timestamp":1725663957065},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:55:21Z","timestamp":1330242921000},"page":"209-222","source":"Crossref","is-referenced-by-count":2,"title":["How to invent characterizable inference methods for regular languages"],"prefix":"10.1007","author":[{"given":"Timo","family":"Knuutila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117\u2013135, 1980.","journal-title":"Information and Control"},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"D. Angluin. Inference of reversible languages. Journal of the ACM, 29(3):741\u2013765, July 1982.","journal-title":"Journal of the ACM"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"C-21","author":"A. W. Biermann","year":"1972","unstructured":"A. W. Biermann and J. A. Feldman. On the synthesis of finite state machines from samples of their behavior. IEEE Transactions on Computers, C-21:592\u2013597, June 1972.","journal-title":"IEEE Transactions on Computers"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","volume":"13","author":"W. S. Brainerd","year":"1968","unstructured":"W. S. Brainerd. The minimalization of tree automata. Information and Control, 13:484\u2013491, 1968.","journal-title":"Information and Control"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0012-365X(82)90281-3","volume":"4","author":"J. A. Brzozowski","year":"1973","unstructured":"J. A. Brzozowski and I. Simon. Characterizations of locally testable events. Discrete Mathematics, 4:243\u2013271, 1973.","journal-title":"Discrete Mathematics"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J. R. B\u00fcchi. Finite Automata, Their Algebras and Grammars. Springer-Verlag, 1989. Edited by D. Siefkes.","DOI":"10.1007\/978-1-4613-8853-1"},{"key":"17_CR7","volume-title":"Syntactic Pattern Recognition and Applications","author":"K-S. Fu","year":"1982","unstructured":"K-S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, 1982."},{"key":"17_CR8","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. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D. Gries","year":"1973","unstructured":"D. Gries. Describing an algorithm by Hopcroft. Acta Informatica, 2:97\u2013109, 1973.","journal-title":"Acta Informatica"},{"key":"17_CR10","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"key":"17_CR11","volume-title":"Syntactic Pattern Recognition: An Introduction","author":"R. C. Gonzalez","year":"1978","unstructured":"R. C. Gonzalez and M. G. Thomason. Syntactic Pattern Recognition: An Introduction. Addison-Wesley, Reading, Massachuttes, 1978."},{"issue":"9","key":"17_CR12","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/34.57687","volume":"PAMI-12","author":"P. Garci\u00e1","year":"1990","unstructured":"P. Garci\u00e1 and E. Vidal. Inference of k-testable languages in the strict sense and application to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-12(9):920\u2013925, September 1990.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"17_CR13","first-page":"137","volume":"35","author":"U. Heuter","year":"1988","unstructured":"U. Heuter. Definite tree languages. Bulletin of the EATCS, 35:137\u2013143, 1988.","journal-title":"Bulletin of the EATCS"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"J. Hopcroft. An n log n algorithm for minimizing states in a finite automaton, pages 189\u2013196. Academic Press, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"T. Knuutila. Inference of k-testable tree languages. In H. Bunke, editor, Advances in Structural and Syntactic Pattern Recognition. World Scientific, 1993. Proceedings of the International Workshop on Structural and Syntactic Pattern Recognition, Bern, Switzerland, 1992.","DOI":"10.1142\/9789812797919_0008"},{"key":"17_CR16","unstructured":"T. Knuutila and M. Steinby. Inference of tree languages from a finite samples: an algebraic approach. Technical Report R-92-2, University of Turku, May 1992. To appear in the Journal of Theoretical Computer Science."},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01761708","volume":"8","author":"R. McNaughton","year":"1974","unstructured":"R. McNaughton. Algebraic decision procedures for local testability. Math. Syst. Theor., 8:60\u201376, 1974.","journal-title":"Math. Syst. Theor."},{"key":"17_CR18","unstructured":"L. Miclet. Structural Methods in Pattern Recognition. Springer-Verlag, 1986."},{"key":"17_CR19","unstructured":"S. Muggleton. Inductive Acquisition of Expert Knowledge. Addison-Wesley, 1990."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"J. E. Pin. Varieties of Formal Languages. North Oxford Academic, 1986.","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/TSMC.1987.6499309","volume":"SMC-17","author":"V. Radhakrishnan","year":"1987","unstructured":"V. Radhakrishnan and G. Nagaraja. Inference of regular grammars via skeletons. IEEE Transactions on Systems, Man, and Cybernetics, SMC-17:982\u2013992, 1987.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"M. Steinby. Some algebraic aspects of recognizability and rationality. In G. Goos and J. Hartmanis, editors, Proceedings of 1981 International Conference on Fundamentals of Computation Theory, number 117 in Lecture Notes in Computer Science, pages 360\u2013372. Springer-Verlag, 1981.","DOI":"10.1007\/3-540-10854-8_40"},{"key":"17_CR23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y. Zalcstein","year":"1972","unstructured":"Y. Zalcstein. Locally testable languages. Journal of Computer and System Sciences, 6:151\u2013167, 1972.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57370-4_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:12:08Z","timestamp":1605629528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}