{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:50Z","timestamp":1725564590522},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_12","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"129-140","source":"Crossref","is-referenced-by-count":6,"title":["A Discontinuity in Pattern Inference"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Reidenbach","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Finding patterns common to a set of strings. In: Proc. STOC 1979, pp. 130\u2013141 (1979)","DOI":"10.1145\/800135.804406"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Inf. Control\u00a045, 117\u2013135 (1980)","journal-title":"Inf. Control"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BFb0035844","volume-title":"STACS 88","author":"G. Fil\u00e8","year":"1988","unstructured":"Fil\u00e8, G.: The relation of two patterns with comparable language. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol.\u00a0294, pp. 184\u2013192. Springer, Heidelberg (1988)"},{"key":"12_CR4","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. Inf. Control\u00a010, 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/00207169408804252","volume":"50","author":"T. Jiang","year":"1994","unstructured":"Jiang, T., Kinber, E., Salomaa, A., Salomaa, K., Yu, S.: Pattern languages with and without erasing. Int. J. Comput. Math.\u00a050, 147\u2013163 (1994)","journal-title":"Int. J. Comput. Math."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision problems for patterns. J. Comput. Syst. Sci.\u00a050, 53\u201363 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generat. Comput.\u00a08, 361\u2013370 (1991)","journal-title":"New Generat. Comput."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(95)00064-X","volume":"63","author":"M. Lipponen","year":"1995","unstructured":"Lipponen, M., P\u0103un, G.: Strongly prime PCP words. Discrete Appl. Math.\u00a063, 193\u2013197 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1051\/ita\/1993270100571","volume":"27","author":"A. Mateescu","year":"1993","unstructured":"Mateescu, A., Salomaa, A.: PCP-prime words and primality types. RAIRO Inform. th\u00e9or.\u00a027(1), 57\u201370 (1993)","journal-title":"RAIRO Inform. th\u00e9or."},{"issue":"3-4","key":"12_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1051\/ita\/1994283-402331","volume":"28","author":"A. Mateescu","year":"1994","unstructured":"Mateescu, A., Salomaa, A.: Finite degrees of ambiguity in pattern languages. RAIRO Inform. th\u00e9or.\u00a028(3-4), 233\u2013253 (1994)","journal-title":"RAIRO Inform. th\u00e9or."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Mitchell, A.R.: Learnability of a subclass of extended pattern languages. In: Proc. COLT 1998, pp. 64\u201371 (1998)","DOI":"10.1145\/279943.279955"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Reidenbach, D.: A non-learnable class of E-pattern languages. Theor. Comp. Sci. (to appear)","DOI":"10.1016\/j.tcs.2005.10.017"},{"key":"12_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-36169-3_25","volume-title":"Algorithmic Learning Theory","author":"D. Reidenbach","year":"2002","unstructured":"Reidenbach, D.: A negative result on inductive inference of extended pattern languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 308\u2013320. Springer, Heidelberg (2002)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Reischuk, R., Zeugmann, T.: Learning one-variable pattern languages in linear average time. In: Proc. COLT 1998, pp. 198\u2013208 (1998)","DOI":"10.1145\/279943.279984"},{"key":"12_CR15","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1992","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1992) (3rd print)"},{"key":"12_CR16","volume-title":"Handbook of Formal Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol.\u00a01. Springer, Berlin (1997)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"12_CR18","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl.\u00a07 (1906)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/09528139408953785","volume":"6","author":"R. Wiehagen","year":"1994","unstructured":"Wiehagen, R., Zeugmann, T.: Ignoring data be the only way to learn efficiently. J. Exp. Theor. Artif. Intell.\u00a06, 131\u2013144 (1994)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proc. COLT 1989, pp. 328\u2013333 (1989)","DOI":"10.1016\/B978-0-08-094829-4.50026-X"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:33:03Z","timestamp":1559611983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}