{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:57:18Z","timestamp":1743065838215,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662472200"},{"type":"electronic","value":"9783662472217"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47221-7_19","type":"book-chapter","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T01:37:49Z","timestamp":1433381869000},"page":"251-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recognition of Linear-Slender Context-Free Languages by Real Time One-Way Cellular Automata"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Terrier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00264617","volume":"21","author":"C Choffrut","year":"1984","unstructured":"Choffrut, C., \u010cul\u00edk II, K.: On real-time cellular automata and trellis automata. Acta Informatica 21(4), 393\u2013407 (1984)","journal-title":"Acta Informatica"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/0020-0190(89)90134-8","volume":"30","author":"K \u010cul\u00edk II","year":"1989","unstructured":"\u010cul\u00edk II, K.: Variations of the firing squad problem and applications. Information Processing Letters 30(3), 152\u2013157 (1989)","journal-title":"Information Processing Letters"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00207168408803421","volume":"16","author":"K \u010cul\u00edk II","year":"1984","unstructured":"\u010cul\u00edk II, K., Gruska, J., Salomaa, A.: Systolic trellis automata. I, II. International Journal Computer Mathematics 16, 3\u201322 (1984)","journal-title":"International Journal Computer Mathematics"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/S0019-9958(86)80011-0","volume":"71","author":"K \u010cul\u00edk II","year":"1986","unstructured":"\u010cul\u00edk II, K., Gruska, J., Salomaa, A.: Systolic trellis automata: Stability, decidability and complexity. Information and Control 71(3), 218\u2013230 (1986)","journal-title":"Information and Control"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0019-9958(80)90164-3","volume":"44","author":"CR Dyer","year":"1980","unstructured":"Dyer, C.R.: One-way bounded cellular automata. Information and Control 44(3), 261\u2013281 (1980)","journal-title":"Information and Control"},{"key":"19_CR6","first-page":"333","volume":"113","author":"S Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded algol-like languages. Transactions of the American Mathematical Society 113, 333\u2013368 (1964)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1051\/ita:2000100","volume":"34","author":"L Ilie","year":"2000","unstructured":"Ilie, L., Rozenberg, G., Salomaa, A.: A characterization of poly-slender context-free languages. Theoretical Informatics and Applications 34(1), 77\u201386 (2000)","journal-title":"Theoretical Informatics and Applications"},{"issue":"1","key":"19_CR8","first-page":"3","volume":"20","author":"M Latteux","year":"1984","unstructured":"Latteux, M., Thierrin, G.: On bounded context-free languages. Elektronische Informationsverarbeitung und Kybernetik 20(1), 3\u20138 (1984)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"19_CR9","unstructured":"Naji, M.: Ambiguity of context-free languages as a function of the word length. FB Informatik. Goethe Universit\u00e4t, Frankfurt am Main (1998)"},{"issue":"1","key":"19_CR10","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 and trellis automata. RAIRO Informatique Thorique et Applications 38(1), 69\u201388 (2004)","journal-title":"RAIRO Informatique Thorique et Applications"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-18381-2_36","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A Okhotin","year":"2011","unstructured":"Okhotin, A.: Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 431\u2013443. Springer, Heidelberg (2011)"},{"issue":"1\u20132","key":"19_CR12","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 141(1\u20132), 331\u2013335 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"19_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00111-5","volume":"156","author":"V Terrier","year":"1996","unstructured":"Terrier, V.: Language not recognizable in real time by one-way cellular automata. Theoretical Computer Science 156(1\u20132), 281\u2013287 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"19_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2005.10.039","volume":"352","author":"V Terrier","year":"2006","unstructured":"Terrier, V.: Closure properties of cellular automata. Theoretical Computer Science 352(1\u20133), 97\u2013107 (2006)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47221-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:06:18Z","timestamp":1559505978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47221-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662472200","9783662472217"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47221-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}