{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:02:54Z","timestamp":1740096174182,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_10","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"106-118","source":"Crossref","is-referenced-by-count":4,"title":["Defining Contexts in Context-Free Grammars"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Barash","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-20712-9_27","volume-title":"Computer Science \u2013 Theory and Applications","author":"T. Aizikowitz","year":"2011","unstructured":"Aizikowitz, T., Kaminski, M.: LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 345\u2013358. Springer, Heidelberg (2011), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-20712-9_27"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N. Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Information and Control\u00a02(2), 137\u2013167 (1959), http:\/\/dx.doi.org\/10.1016\/S0019-9958(59)90362-6","journal-title":"Information and Control"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(73)80050-9","volume":"7","author":"K. \u010cul\u00edk II","year":"1973","unstructured":"\u010cul\u00edk II, K., Cohen, R.: LR-regular grammars\u2014an extension of LR(k) grammars. Journal of Computer and System Sciences\u00a07(1), 66\u201396 (1973), http:\/\/dx.doi.org\/10.1016\/S0022-0000(73)80050-9","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1142\/S0129054107005248","volume":"18","author":"Z. \u00c9sik","year":"2007","unstructured":"\u00c9sik, Z., Kuich, W.: Boolean fuzzy sets. International Journal of Foundations of Computer Science\u00a018(6), 1197\u20131207 (2007), \n                    \n                      http:\/\/dx.doi.org\/10.1142\/S0129054107005248","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10_CR5","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. In: Proceedings of POPL 2004, Venice, Italy, January 14-16, pp. 111\u2013122 (2004), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/964001.964011"},{"key":"10_CR6","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), \n                    \n                      http:\/\/dx.doi.org\/10.1145\/321127.321132","journal-title":"Journal of the ACM"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S012905410800584X","volume":"19","author":"A. Je\u017c","year":"2008","unstructured":"Je\u017c, A.: Conjunctive grammars can generate non-regular unary languages. International Journal of Foundations of Computer Science\u00a019(3), 597\u2013615 (2008), \n                    \n                      http:\/\/dx.doi.org\/10.1142\/S012905410800584X","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00224-008-9139-5","volume":"46","author":"A. Je\u017c","year":"2010","unstructured":"Je\u017c, A., Okhotin, A.: Conjunctive grammars over a unary alphabet: undecidability and unbounded growth. Theory of Computing Systems\u00a046(1), 27\u201358 (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00224-008-9139-5","journal-title":"Theory of Computing Systems"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0020-0190(75)90009-5","volume":"4","author":"S. Jarzabek","year":"1975","unstructured":"Jarzabek, S., Krawczyk, T.: LL-regular grammars. Information Processing Letters\u00a04, 31\u201337 (1975), http:\/\/dx.doi.org\/10.1016\/0020-0190(75)90009-5","journal-title":"Information Processing Letters"},{"issue":"9","key":"10_CR10","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.ic.2009.05.002","volume":"207","author":"V. Kountouriotis","year":"2009","unstructured":"Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for Boolean grammars. Information and Computation\u00a0207(9), 945\u2013967 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.ic.2009.05.002","journal-title":"Information and Computation"},{"issue":"4","key":"10_CR11","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":"10_CR12","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 Science\u00a028(5), 243\u2013249 (2002), \n                    \n                      http:\/\/dx.doi.org\/10.1023\/A:1020213411126","journal-title":"Programming and Computer Science"},{"issue":"1","key":"10_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), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.ic.2004.03.006","journal-title":"Information and Computation"},{"issue":"2-3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.tcs.2005.07.019","volume":"345","author":"A. Okhotin","year":"2005","unstructured":"Okhotin, A.: The dual of concatenation. Theoretical Computer Science\u00a0345(2-3), 425\u2013447 (2005), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2005.07.019","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1142\/S0129054106004029","volume":"17","author":"A. Okhotin","year":"2006","unstructured":"Okhotin, A.: Generalized LR parsing algorithm for Boolean grammars. International Journal of Foundations of Computer Science\u00a017(3), 629\u2013664 (2006), \n                    \n                      http:\/\/dx.doi.org\/10.1142\/S0129054106004029","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3-4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00236-007-0045-0","volume":"44","author":"A. Okhotin","year":"2007","unstructured":"Okhotin, A.: Recursive descent parsing for Boolean grammars. Acta Informatica\u00a044(3-4), 167\u2013189 (2007), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00236-007-0045-0","journal-title":"Acta Informatica"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-14455-4_31","volume-title":"Developments in Language Theory","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A.: Fast Parsing for Boolean Grammars: A Generalization of Valiant\u2019s Algorithm. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol.\u00a06224, pp. 340\u2013351. Springer, Heidelberg (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/978-3-642-14455-4_31"},{"issue":"26-28","key":"10_CR18","doi-asserted-by":"publisher","first-page":"2559","DOI":"10.1016\/j.tcs.2010.03.015","volume":"411","author":"A. Okhotin","year":"2010","unstructured":"Okhotin, A., Reitwie\u00dfner, C.: Conjunctive grammars with restricted disjunction. Theoretical Computer Science\u00a0411(26-28), 2559\u20132571 (2010), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2010.03.015","journal-title":"Theoretical Computer Science"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Parr, T., Fisher, K.: LL(*): the foundation of the ANTLR parser generator. In: Programming Language Design and Implementation, PLDI 2011, San Jose, USA, June 4-8, pp. 425\u2013436 (2011), \n                    \n                      http:\/\/dx.doi.org\/10.1145\/1993316.1993548","DOI":"10.1145\/1993316.1993548"},{"key":"10_CR20","doi-asserted-by":"publisher","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)"},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. Journal of Computer and System Sciences\u00a010(2), 308\u2013314 (1975), http:\/\/dx.doi.org\/10.1016\/S0022-0000(75)80046-8","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:30:10Z","timestamp":1556425810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}