{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:06:51Z","timestamp":1767236811972,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_6","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"71-83","source":"Crossref","is-referenced-by-count":6,"title":["Learning Commutative Regular Languages"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Cano G\u00f3mez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gloria I.","family":"\u00c1lvarez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"28","volume-title":"Grammatical Inference: Algorithms and Applications","author":"J. Ruiz","year":"2002","unstructured":"Ruiz, J., Cano, A., Garc\u00eda, P.: Inferring subclasses of regular languages faster using RPNI and forbidden configurations. In: Adriaans, P.W., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol.\u00a02484, pp. 28\u201336. Springer, Heidelberg (2002)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Agluin","year":"1980","unstructured":"Agluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045(2), 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"6_CR3","first-page":"291","volume-title":"Shape, Structure and Pattern Recogniton, Proc. Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR 1994","author":"R. Alqu\u00e9zar","year":"1995","unstructured":"Alqu\u00e9zar, R., Sanfeliu, A.: Incremental grammatical inference from positive and negative data using unbiased finite state automata. In: Shape, Structure and Pattern Recogniton, Proc. Int. Workshop on Structural and Syntactic Pattern Recognition, SSPR 1994, pp. 291\u2013300. World Scientific, Singopore (1995)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1162\/153244304773936063","volume":"4","author":"O. Cichelo","year":"2003","unstructured":"Cichelo, O., Kremer, S.C.: Inducing grammars from sparce data sets: A survey of algorithms and results. Journal of Machine Learning Research\u00a04, 603\u2013632 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11872436_13","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Clark","year":"2006","unstructured":"Clark, A., Flor\u00eancio, C.C., Watkins, C., Serayet, M.: Planar languages and learnability. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 148\u2013160. Springer, Heidelberg (2006)"},{"key":"6_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-3-540-45257-7_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F. Coste","year":"2000","unstructured":"Coste, F., Fredouille, D.: Efficient ambiguity detection in C-NFA. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 25\u201338. Springer, Heidelberg (2000)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"6_CR8","volume-title":"Introduction to automata theory, languages and computation","author":"J. Hopcroft","year":"1980","unstructured":"Hopcroft, J., Ullman, J.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1980)"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Grammatical Inference","author":"B.A. Pearlmutter","year":"1998","unstructured":"Pearlmutter, B.A., Lang, K.J., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Lang, K.J.: Random dfa\u2019s can be approximately learned from sparse uniform. In: Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp. 45\u201352 (1992)","DOI":"10.1145\/130385.130390"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial updated time. In: Pattern Recognition and Image Analysis (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"6_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of formal languages","author":"J.-E. Pin","year":"1986","unstructured":"Pin, J.-E.: Varieties of formal languages. North Oxford, London (1986) (Traduction of Vari\u00e9t\u00e9s de langages formels)"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of formal languages, ch. 10","author":"J.-\u00c9. Pin","year":"1997","unstructured":"Pin, J.-\u00c9.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages, ch. 10, vol.\u00a01, pp. 679\u2013746. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:49:07Z","timestamp":1715312947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}