{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T16:22:02Z","timestamp":1769876522088,"version":"3.49.0"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319986531","type":"print"},{"value":"9783319986548","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_45","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"553-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Structural Lemma for Deterministic Context-Free Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8850-9749","authenticated-orcid":false,"given":"Alexander A.","family":"Rubtsov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Verlag (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"45_CR2","unstructured":"Boasson, L.: Un crit\u00e8re de rationnalite des langages alg\u00e9briques. Automata, Languages. Programming. In: Proc. Sympos. Inst. Rech. Informatique Automatique (IRIA), Rocquencourt, 1972, pp. 359\u2013365 (1973)"},{"issue":"1","key":"45_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1051\/ita\/1985190100431","volume":"19","author":"A Ehrenfeucht","year":"1985","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Strong iterative pairs and the regularity of context-free languages. RAIRO. Inform. Th\u00e9or. 19(1), 43\u201356 (1985)","journal-title":"RAIRO. Inform. Th\u00e9or."},{"issue":"5","key":"45_CR4","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1137\/S0097539702417754","volume":"32","author":"O Glier","year":"2003","unstructured":"Glier, O.: Kolmogorov complexity and deterministic context-free languages. SIAM J. Comput. 32(5), 1389\u20131394 (2003)","journal-title":"SIAM J. Comput."},{"key":"45_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"key":"45_CR6","series-title":"Text and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"1993","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Text and Monographs in Computer Science. Springer, Heidelberg (1993). \n                    https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S009753979324485X","volume":"24","author":"M Li","year":"1995","unstructured":"Li, M., Vit\u00e1nyi, P.: A new approach to formal language theory by Kolmogorov complexity. SIAM J. Comput. 24(2), 398\u2013410 (1995)","journal-title":"SIAM J. Comput."},{"key":"45_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"JO Shallit","year":"2008","unstructured":"Shallit, J.O.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)"},{"issue":"1","key":"45_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(89)90108-7","volume":"31","author":"S Yu","year":"1989","unstructured":"Yu, S.: A pumping lemma for deterministic context-free languages. Inf. Process. Lett. 31(1), 47\u201351 (1989)","journal-title":"Inf. Process. Lett."}],"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-319-98654-8_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:22:28Z","timestamp":1535916148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}