{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:48Z","timestamp":1725543468193},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_23","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"248-259","source":"Crossref","is-referenced-by-count":2,"title":["The Boolean Closure of Growing Context-Sensitive Languages"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-55719-9_65","volume-title":"Automata, Languages and Programming","author":"G. Buntrock","year":"1992","unstructured":"Buntrock, G., Lory\u015b, K.: On growing context-sensitive languages. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 77\u201388. Springer, Heidelberg (1992)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2681","volume":"141","author":"G. Buntrock","year":"1998","unstructured":"Buntrock, G., Otto, F.: Growing Context-Sensitive Languages and Church-Rosser Languages. Information and Compation\u00a0141(1), 1\u201336 (1998)","journal-title":"Information and Compation"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/0022-0000(86)90062-0","volume":"33","author":"E. Dahlhaus","year":"1986","unstructured":"Dahlhaus, E., Warmuth, M.K.: Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences\u00a033(3), 456\u2013472 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11537311_27","volume-title":"Fundamentals of Computation Theory","author":"M. Holzer","year":"2005","unstructured":"Holzer, M., Otto, F.: Shrinking Multi-pushdown Automata. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 305\u2013316. Springer, Heidelberg (2005)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45465-9_14","volume-title":"Automata, Languages and Programming","author":"T. Jurdzinski","year":"2002","unstructured":"Jurdzinski, T., Lorys, K.: Church-Rosser Languages vs. UCFL. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 147\u2013158. Springer, Heidelberg (2002), full version: www.ii.uni.wroc.pl\/~tju\/FullCRL.pdf1"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-30550-7_24","volume-title":"Developments in Language Theory","author":"M. Kutrib","year":"2004","unstructured":"Kutrib, M., Malcher, A., Wotschke, D.: The Boolean Closure of Linear Context-Free Languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 284\u2013295. Springer, Heidelberg (2004)"},{"key":"23_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M. Li","year":"1993","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. Springer, Heidelberg (1993)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01762237","volume":"7","author":"L.Y. Liu","year":"1973","unstructured":"Liu, L.Y., Weiner, P.: An infinite hierarchy of intersections of context-free languages. Mathematical Systems Theory\u00a07, 185\u2013192 (1973)","journal-title":"Mathematical Systems Theory"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"McNaughton, R.: An insertion into the Chomsky hierarchy? Jewels are Forever, Contributions on Theoretical Computer Science in Honour of A. Salomaa, pp. 204\u2013212. Springer, Heidelberg (1999)","DOI":"10.1007\/978-3-642-60207-8_18"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association Computing Machinery\u00a035, 324\u2013344 (1988)","journal-title":"Journal of the Association Computing Machinery"},{"key":"23_CR11","unstructured":"Niemann, G.: Church-Rosser Languages and Related Classes. PhD Thesis, Univ.\u00a0Kassel (2002)"},{"issue":"1-2","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.09.003","volume":"197","author":"G. Niemann","year":"2005","unstructured":"Niemann, G., Otto, F.: The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. Inform. and Comp.\u00a0197(1-2), 1\u201321 (2005)","journal-title":"Inform. and Comp."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: Boolean grammars. Information and Computation\u00a0194(1), 19\u201348 (2004)","journal-title":"Information and Computation"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-662-41148-3_11","volume-title":"GI - 3. Jahrestagung","author":"D. Wotschke","year":"1973","unstructured":"Wotschke, D.: The Boolean Closures of the Deterministisc and Nondeterministic Context-free Languages. In: Brauer, W. (ed.) GI 1973. LNCS, vol.\u00a01, pp. 113\u2013121. Springer, Heidelberg (1973)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0039154","volume-title":"1. Fachtagung \u00fcber Automatentheorie und Formale Sprachen","author":"D. Wotschke","year":"1973","unstructured":"Wotschke, D.: A Characterization of Boolean Closures of Families of Languages. In: B\u00f6hling, K.-H., Indermark, K. (eds.) GI-Fachtagung 1973. LNCS, vol.\u00a02, pp. 191\u2013200. Springer, Heidelberg (1973)"},{"issue":"3","key":"23_CR16","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/0022-0000(78)90030-2","volume":"16","author":"D. Wotschke","year":"1978","unstructured":"Wotschke, D.: Nondeterminism and Boolean Operations in PDAs. J. Comput. Syst. Sci.\u00a016(3), 456\u2013461 (1978)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:49Z","timestamp":1619507749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11779148_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}