{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:20Z","timestamp":1725790940979},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_17","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"190-201","source":"Crossref","is-referenced-by-count":3,"title":["Linear Grammars with One-Sided Contexts and Their Automaton Representation"],"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":"17_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)"},{"key":"17_CR2","unstructured":"Barash, M.: Recursive descent parsing for grammars with contexts. In: SOFSEM 2013 Student Research Forum (2013)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-28332-1_10","volume-title":"Language and Automata Theory and Applications","author":"M. Barash","year":"2012","unstructured":"Barash, M., Okhotin, A.: Defining contexts in context-free grammars. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 106\u2013118. Springer, Heidelberg (2012)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Barash, M., Okhotin, A.: An extension of context-free grammars with one-sided context specifications (September 2013) (submitted)","DOI":"10.1016\/j.ic.2014.03.003"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"\u010cul\u00edk II, K., Gruska, J., Salomaa, A.: Systolic trellis automata. International Journal of Computer Mathematics 15, 195\u2013212, 16, 3\u201322 (1984)","DOI":"10.1080\/00207168408803421"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"C. Dyer","year":"1980","unstructured":"Dyer, C.: One-way bounded cellular automata. Information and Control\u00a044, 261\u2013281 (1980)","journal-title":"Information and Control"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(84)90015-X","volume":"29","author":"O.H. Ibarra","year":"1984","unstructured":"Ibarra, O.H., Kim, S.M.: Characterizations and computational complexity of systolic trellis automata. Theoretical Computer Science\u00a029, 123\u2013153 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"17_CR8","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)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1","key":"17_CR9","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)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s00224-009-9246-y","volume":"48","author":"A. Je\u017c","year":"2011","unstructured":"Je\u017c, A., Okhotin, A.: Complexity of equations over sets of natural numbers. Theory of Computing Systems\u00a048(2), 319\u2013342 (2011)","journal-title":"Theory of Computing Systems"},{"issue":"4","key":"17_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":"1","key":"17_CR12","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)","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2013.06.001","volume":"9","author":"A. Okhotin","year":"2013","unstructured":"Okhotin, A.: Conjunctive and Boolean grammars: the true general case of the context-free grammars. Computer Science Review\u00a09, 27\u201359 (2013)","journal-title":"Computer Science Review"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-39310-5_20","volume-title":"Descriptional Complexity of Formal Systems","author":"A. Okhotin","year":"2013","unstructured":"Okhotin, A.: Improved normal form for grammars with one-sided contexts. In: Jurgensen, H., Reis, R. (eds.) DCFS 2013. LNCS, vol.\u00a08031, pp. 205\u2013216. Springer, Heidelberg (2013)"},{"key":"17_CR15","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability (1967)"},{"issue":"4","key":"17_CR16","first-page":"1","volume":"14","author":"W.C. Rounds","year":"1988","unstructured":"Rounds, W.C.: LFP: A logic for linguistic descriptions and an analysis of its complexity. Computational Linguistics\u00a014(4), 1\u20139 (1988)","journal-title":"Computational Linguistics"},{"issue":"1-2","key":"17_CR17","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(1-2), 331\u2013335 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR18","unstructured":"T\u00f6rm\u00e4, I.: Personal communication (February 2013)"},{"issue":"1","key":"17_CR19","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)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:43:28Z","timestamp":1558860208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}