{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:14Z","timestamp":1725572174823},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_54","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"698-710","source":"Crossref","is-referenced-by-count":1,"title":["The Dual of Concatenation"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"54_CR1","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer Programming and Formal Systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.P.: The algebraic theory of context-free languages. In: Braffort, H. (ed.) Computer Programming and Formal Systems, pp. 118\u2013161. North-Holland Publishing Company, Amsterdam (1963)"},{"key":"54_CR2","doi-asserted-by":"crossref","unstructured":"Ellul, K., Shallit, J., Wang, M.-w.: Regular expressions: new results and open problems. In: Pre-proc. of DCFS 2002, London, Canada, August 21-24, pp. 17\u201334 (2002)","DOI":"10.12968\/prps.2002.1.34.40339"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM\u00a09, 350\u2013371 (1962)","journal-title":"Journal of the ACM"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(94)90227-5","volume":"132","author":"E.L. Leiss","year":"1994","unstructured":"Leiss, E.L.: Unrestricted complementation in language equations over a one-letter alphabet. Theoretical Computer Science\u00a0132, 71\u201393 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"54_CR5","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"5","key":"54_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1020213411126","volume":"28","author":"A. Okhotin","year":"2002","unstructured":"Okhotin, A.: Conjunctive grammars and systems of language equations. Programming and Computer Software\u00a028(5), 243\u2013249 (2002)","journal-title":"Programming and Computer Software"},{"key":"54_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45061-0_21","volume-title":"Automata, Languages and Programming","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: Decision problems for language equations with Boolean operations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 239\u2013251. Springer, Heidelberg (2003)"},{"issue":"1","key":"54_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2004004","volume":"38","author":"A. Okhotin","year":"2004","unstructured":"Okhotin, A.: On the equivalence of linear conjunctive grammars to trellis automata. Informatique Th\u00e9orique et Applications\u00a038(1), 69\u201388 (2004)","journal-title":"Informatique Th\u00e9orique et Applications"},{"key":"54_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-45007-6_32","volume-title":"Developments in Language Theory","author":"A. Okhotin","year":"2003","unstructured":"Okhotin, A.: Boolean grammars. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 398\u2013410. Springer, Heidelberg (2003)"},{"key":"54_CR10","unstructured":"Okhotin, A.: Greatest solutions of language equations (submitted)"},{"key":"54_CR11","unstructured":"Okhotin, A.: A Boolean grammar for a simple programming language. Tech. Rep. 2004\u2013478, School of Computing, Queen\u2019s University, Kingston, Ontario, Canada"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"S.M. Shieber","year":"1995","unstructured":"Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. Journal of Logic Programming\u00a024, 3\u201336 (1995)","journal-title":"Journal of Logic Programming"},{"key":"54_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60541-3","volume-title":"Parsing Schemata","author":"K. Sikkel","year":"1997","unstructured":"Sikkel, K.: Parsing Schemata. Springer, Heidelberg (1997)"},{"key":"54_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 deterministic and nondeterministic contextfree languages. In: Brauer, W. (ed.) GI 1973. LNCS, vol.\u00a01, pp. 113\u2013121. Springer, Heidelberg (1973)"},{"key":"54_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular Languages. In: Rozenberg, Salomaa (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 41\u2013110. Springer, Berlin (1997)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:25:47Z","timestamp":1605759947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}