{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:42:12Z","timestamp":1736314932917,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_9","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"104-115","source":"Crossref","is-referenced-by-count":0,"title":["Finite Automata and Unions of Regular Patterns with Bounded Constant Segments"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Cano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(99)00270-4","volume":"241","author":"T. Shinohara","year":"2000","unstructured":"Shinohara, T., Arimura, H.: Inductive inference of unbounded unions of pattern languages from positive data. Theoretical Computer Science\u00a0241, 191\u2013209 (2000)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02679467","volume":"30","author":"J.E. Pin","year":"1997","unstructured":"Pin, J.E., Weil, P.: Polynomial closure and unambiguous product. Theory Comput. Systems\u00a030, 1\u201338 (1997)","journal-title":"Theory Comput. Systems"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Finding common patterns to a set of strings. In: Proc. 11th Ann. Symp. Theory of Computing, pp. 130\u2013141 (1979)","DOI":"10.1145\/800135.804406"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A., Shinohara, T.: A learning algorithm for elementary formal systems and its experiments on identification of trandmembrane domains. In: Proc. 25th Hawaii Int. Conf. on System Science, vol.\u00a01, pp. 675\u2013684 (1992)","DOI":"10.1109\/HICSS.1992.183220"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"5677","DOI":"10.1081\/AGB-120016005","volume":"30","author":"J.E. Pin","year":"2002","unstructured":"Pin, J.E., Weil, P.: The wreath product principle for ordered semigroups. Communications in Algebra\u00a030, 5677\u20135713 (2002)","journal-title":"Communications in Algebra"},{"key":"9_CR6","unstructured":"Garcia, P., Ruiz, J.: Learning in varieties of the form V*LI from positive data (to appear)"},{"key":"9_CR7","unstructured":"Garcia, P., Ruiz, J.: Learning k-testable and k-piecewise testable languages from positive data. Grammars. Special Issue on Grammar Induction, 125\u2013140 (2004)"},{"key":"9_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":"9_CR9","doi-asserted-by":"crossref","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control, 447\u2013474 (1967)","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Varieties of formal languages. North Oxford, London and Plenum, New York (1986) (Traduction of Vari\u00e9t\u00e9s de langages formels)","DOI":"10.1007\/978-1-4613-2215-3_3"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context Free Languages. Teubner (1979)","DOI":"10.1007\/978-3-663-09367-1"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:04:51Z","timestamp":1736287491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11605157_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}