{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:02Z","timestamp":1747546922471,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429128"},{"type":"electronic","value":"9783540456278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45627-9_19","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T15:57:04Z","timestamp":1181663824000},"page":"223-232","source":"Crossref","is-referenced-by-count":5,"title":["Approximative Learning of Regular Languages"],"prefix":"10.1007","author":[{"given":"Henning","family":"Fernau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin.Inference of reversible languages.Journal of the Association for Computing Machinery, 29(3):741\u2013765, 1982.","DOI":"10.1145\/322326.322334"},{"key":"19_CR2","unstructured":"P. Dupont and L. Miclet.Inf\u00e9rence grammaticale r\u00e9guli\u00e8re:fondements th\u00e9oriques et principaux algorithmes.Technical Report RR-3449, INRIA, 1998."},{"key":"19_CR3","unstructured":"H. Fernau.Learning of terminal distinguishable languages.Technical Report WSI-99-23, Universit\u00e4t T\u00fcbingen (Germany), Wilhelm-Schickard-Institut f\u00fcr Informatik, 1999. Short version published in the proceedings of AMAI 2000, see http:\/\/rutcor.rutgers.edu\/~amai\/AcceptedCont.htm ."},{"key":"19_CR4","unstructured":"H. Fernau.Identifying terminal distinguishable languages. Submitted revised version of [3]."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"H. Fernau.k-gram extensions of terminal distinguishable languages. In Proc.15th International Conference on Pattern Recognition.2nd Volume, pp.125\u2013128, IEEE Press, 2000.","DOI":"10.1109\/ICPR.2000.906031"},{"key":"19_CR6","series-title":"Lect Notes Comput Sci","first-page":"116","volume-title":"Identification of function distinguishable languages","author":"A. Pasquale Di","year":"2000","unstructured":"H. Fernau.Identification of function distinguishable languages. In Proc.11th International Conference Algorithmic Learning Theory (ALT), volume 1968 of LNCS\/LNAI, pages 116\u2013130. Springer, 2000."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"H. Fernau.Parallel communicating grammar systems with terminal transmission. Acta Informatica, 37:511\u2013540, 2001.","DOI":"10.1007\/PL00013312"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","first-page":"73","volume-title":"Learning XML Grammars","author":"B. Kr\u00f6ll","year":"2001","unstructured":"H. Fernau.Learning XML Grammars. In Proc.2nd Machine Learning and Data Mining in Pattern Recognition MLDM\u2019 01, volume 2123 of LNCS\/LNAI, pages 73\u201387. Springer, 2001."},{"key":"19_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-3-540-45257-7_7","volume-title":"Permutations and control sets for learning non-regular language families","author":"H. Fernau","year":"2000","unstructured":"H. Fernau and J.M. Sempere.Permutations and control sets for learning non-regular language families. In Proc.5th International Colloquium on Grammatical Inference (ICGI):Algorithms and Applications, volume 1891 of LNCS\/LNAI, pages 75\u201378. Springer, 2000."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"E.M. Gold.Language identification in the limit.Information and Control (now Information and Computation), 10:447\u2013474, 1967.","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"J. Gregor.Data-driven inductive inference of finite-state automata.International Journal of Pattern Recognition and Artificial Intelligence, 8(1):305\u2013322, 1994.","DOI":"10.1142\/S0218001494000140"},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-60454-5_47","volume-title":"On approximately identifying concept classes in the limit","author":"S. Kobayashi","year":"1995","unstructured":"S. Kobayashi and T. Yokomori.On approximately identifying concept classes in the limit. In Proc.6th International Conference Algorithmic Learning Theory (ALT), volume 997 of LNCS\/LNAI, pages 298\u2013312. Springer, 1995."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0304-3975(96)00224-1","volume":"174","author":"S. Kobayashi","year":"1997","unstructured":"S. Kobayashi and T. Yokomori.Learning approximately regular languages with reversible languages.Theoretical Computer Science, 174:251\u2013257, 1997.","journal-title":"Theoretical Computer Science"},{"key":"19_CR14","series-title":"Lect Notes Comput Sci","first-page":"237","volume-title":"On the languages accepted by finite reversible automata","author":"E. Nardelli","year":"1987","unstructured":"J.E. Pin.On the languages accepted by finite reversible automata. In 14th ICALP\u2019 87, volume 267 of LNCS, pages 237\u2013249, 1987."},{"key":"19_CR15","unstructured":"V. Radhakrishnan.Grammatical Inference from Positive Data:An Effective Inte-grated Approach. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay (India), 1987."},{"issue":"6","key":"19_CR16","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/TSMC.1987.6499309","volume":"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, 17(6):982\u2013992, 1987.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Y. Takada.A hierarchy of language families learnable by regular language learning. Information and Computation, 123:138\u2013145, 1995.","DOI":"10.1006\/inco.1995.1163"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2001: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45627-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:35:45Z","timestamp":1737095745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45627-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429128","9783540456278"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45627-9_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}