{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:12Z","timestamp":1759637772188,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_39","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"446-457","source":"Crossref","is-referenced-by-count":2,"title":["Expressive Power of LL(k) Boolean Grammars"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","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., Lory\u015b, 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)"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11779148_19","volume-title":"Developments in Language Theory","author":"V. Kountouriotis","year":"2006","unstructured":"Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for Boolean grammars. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 203\u2013214. Springer, Heidelberg (2006)"},{"issue":"4","key":"39_CR3","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":"1","key":"39_CR4","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. RAIRO Informatique Th\u00e9orique et Applications\u00a038(1), 69\u201388 (2004), \n                    \n                      http:\/\/dx.doi.org\/\n                    \n                    \n                  , doi:10.1051\/ita:2004004","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"issue":"1","key":"39_CR5","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":"3","key":"39_CR6","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"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Okhotin, A.: Recursive descent parsing for Boolean grammars. Acta Informatica (to appear), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/s00236-007-0045-0","DOI":"10.1007\/s00236-007-0045-0"},{"key":"39_CR8","unstructured":"Okhotin, A.: A simple P-complete problem and its representations by language equations. Machines, Computations and Universality (MCU, Orl\u00e9ans, France, September 10-14, 2007) (accepted, 2007)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)00212-2","volume":"141","author":"V. Terrier","year":"1995","unstructured":"Terrier, V.: On real-time one-way cellular array. Theoretical Computer Science\u00a0141, 331\u2013335 (1995), \n                    \n                      http:\/\/dx.doi.org\/\n                    \n                    \n                  , doi:10.1016\/0304-3975(94)00212-2","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0166-218X(86)90025-9","volume":"15","author":"S. Yu","year":"1986","unstructured":"Yu, S.: A property of real-time trellis automata. Discrete Applied Mathematics\u00a015(1), 117\u2013119 (1986), \n                    \n                      http:\/\/dx.doi.org\/\n                    \n                    \n                  , doi:10.1016\/0166-218x(86)90025-9","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:15:22Z","timestamp":1619518522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}