{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:38:48Z","timestamp":1769971128851,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540569398","type":"print"},{"value":"9783540478263","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_81","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:55:52Z","timestamp":1330239352000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Inclusion is undecidable for pattern languages"],"prefix":"10.1007","author":[{"given":"Tao","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin, \u201cFinding patterns common to a set of strings\u201d, Journal of Computer and System Sciences 21 (1980) 46\u201362.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin, \u201cInductive inference of formal languages from positive data\u201d, Information and Control 45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"B. S. Baker","year":"1974","unstructured":"B.S. Baker and R.V. Book, \u201cReversal-bounded multipushdown machines\u201d, Journal of Computer and System Sciences 8 (1974) 315\u2013332.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D. R. Bean","year":"1979","unstructured":"D. R. Bean, A. Ehrenfeucht, and G. F. McNulty, \u201cAvoidable patterns in strings of symbols\u201d, Pacific Journal of Mathematics 85 (1979) 261\u2013294.","journal-title":"Pacific Journal of Mathematics"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"T. Harju and J. Karhum\u00e4ki, \u201cThe equivalence problem of multitape finite automata\u201d, Theoretical Computer Science 78 (1991) 347\u2013355.","journal-title":"Theoretical Computer Science"},{"key":"25_CR6","volume-title":"Introduction to Formal Language Theory","author":"M. A. Harrison","year":"1978","unstructured":"M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978."},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O. H. Ibarra","year":"1978","unstructured":"O.H. Ibarra, \u201cReversal-bounded multicounter machines and their decision problems\u201d, Journal of the Association for Computing Machinery 25 (1978) 116\u2013133.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0022-0000(91)90016-X","volume":"43","author":"O. Ibarra","year":"1991","unstructured":"O. Ibarra and T. Jiang \u201cLearning regular languages from counterexamples\u201d, Journal of Computer and System Sciences, 43 (1991) 299\u2013316.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR9","unstructured":"T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, S. Yu, \u201cPattern languages with and without erasing\u201d, to appear in the International Journal of Computer Mathematics."},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. L. Minsky","year":"1961","unstructured":"M.L. Minsky, \u201cRecursive unsolvability of Post's problem of \u2018Tag\u2019 and other topics in theory of Turing machines\u201d, Annals of Mathematics 74 (1961) 437\u2013455.","journal-title":"Annals of Mathematics"},{"key":"25_CR11","first-page":"125","volume":"E75-D","author":"N. Tanida","year":"1992","unstructured":"N. Tanida and T. Yokomori, \u201cPolynomial-time identification of strictly regular languages in the limit\u201d, IEICE Trans. Inf. and Syst. E75-D (1992) 125\u2013132.","journal-title":"IEICE Trans. Inf. and Syst."},{"key":"25_CR12","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"A. Thue, \u201c\u00fcber unendliche Zeichenreihen\u201d, Norske Vid. Selsk. Skr., I Mat. Nat. Kl, Christiania 7 (1906) 1\u201322.","journal-title":"Norske Vid. Selsk. Skr., I Mat. Nat. Kl, Christiania"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:01:32Z","timestamp":1578510092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_81"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}