{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T19:34:10Z","timestamp":1794425650340,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642316524","type":"print"},{"value":"9783642316531","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_13","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T05:51:39Z","timestamp":1342245099000},"page":"130-141","source":"Crossref","is-referenced-by-count":1,"title":["Regular and Context-Free Pattern Languages over Small Alphabets"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Reidenbach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/322307.322315","volume":"29","author":"C. Bader","year":"1982","unstructured":"Bader, C., Moura, A.: A generalization of Ogden\u2019s Lemma. Journal of the Association for Computing Machinery\u00a029, 404\u2013407 (1982)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. International Journal of Foundations of Computer Science\u00a014, 1007\u20131018 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ic.2009.04.002","volume":"208","author":"D.D. Freydenberger","year":"2010","unstructured":"Freydenberger, D.D., Reidenbach, D.: Bad news on decision problems for patterns. Information and Computation\u00a0208, 83\u201396 (2010)","journal-title":"Information and Computation"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1142\/S0129054106004017","volume":"17","author":"D.D. Freydenberger","year":"2006","unstructured":"Freydenberger, D.D., Reidenbach, D., Schneider, J.C.: Unambiguous morphic images of strings. International Journal of Foundations of Computer Science\u00a017, 601\u2013628 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Harju, T., Karhum\u00e4ki, J.: Morphisms. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch. 7, pp. 439\u2013510. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_7"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1016\/j.ipl.2010.09.010","volume":"110","author":"S. Jain","year":"2010","unstructured":"Jain, S., Ong, Y.S., Stephan, F.: Regular patterns, regular languages and context-free languages. Information Processing Letters\u00a0110, 1114\u20131119 (2010)","journal-title":"Information Processing Letters"},{"key":"13_CR8","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. International Journal of Computer Mathematics\u00a050, 147\u2013163 (1994)","journal-title":"International Journal of Computer Mathematics"},{"key":"13_CR9","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 Generation Computing\u00a08, 361\u2013370 (1991)","journal-title":"New Generation Computing"},{"key":"13_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 Informatique th\u00e9oretique et Applications\u00a028, 233\u2013253 (1994)","journal-title":"RAIRO Informatique th\u00e9oretique et Applications"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Mateescu, A., Salomaa, A.: Patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 230\u2013242. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_1"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2008.02.028","volume":"397","author":"Y.K. Ng","year":"2008","unstructured":"Ng, Y.K., Shinohara, T.: Developments from enquiries into the learnability of the pattern languages from positive data. Theoretical Computer Science\u00a0397, 150\u2013165 (2008)","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","unstructured":"Reidenbach, D.: The Ambiguity of Morphisms in Free Monoids and its Impact on Algorithmic Properties of Pattern Languages. PhD thesis, Fachbereich Informatik, Technische Universit\u00e4t Kaiserslautern. Logos Verlag, Berlin (2006)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2008.02.029","volume":"397","author":"D. Reidenbach","year":"2008","unstructured":"Reidenbach, D.: Discontinuities in pattern inference. Theoretical Computer Science\u00a0397, 166\u2013193 (2008)","journal-title":"Theoretical Computer Science"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1010875913047","volume":"44","author":"P. Rossmanith","year":"2001","unstructured":"Rossmanith, P., Zeugmann, T.: Stochastic finite learning of the pattern languages. Machine Learning\u00a044, 67\u201391 (2001)","journal-title":"Machine Learning"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"13_CR17","unstructured":"Shinohara, T.: Polynomial time inference of pattern languages and its application. In: Proc. 7th IBM MFCS, pp. 191\u2013209 (1982)"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, ch. 2, pp. 41\u2013110. Springer (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:41:26Z","timestamp":1620114086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}