{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:52Z","timestamp":1759638712487},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":1397,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1016\/j.entcs.2009.09.015","type":"journal-article","created":{"date-parts":[[2009,9,25]],"date-time":"2009-09-25T12:48:55Z","timestamp":1253882935000},"page":"77-91","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["On One-way One-bit O (One)-message Cellular Automata"],"prefix":"10.1016","volume":"252","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2009.09.015_bib001","series-title":"New Developments in Formal Languages and Applications","first-page":"183","article-title":"Cellular automata \u2013 a computational point of view","author":"Kutrib","year":"2008"},{"key":"10.1016\/j.entcs.2009.09.015_bib002","doi-asserted-by":"crossref","unstructured":"Kutrib, M., Cellular automata and language theory, in: Encyclopedia of Complexity and System Science, Springer, 2009 in press","DOI":"10.1007\/978-0-387-30440-3_54"},{"key":"10.1016\/j.entcs.2009.09.015_bib003","unstructured":"Kutrib, M. and A. Malcher, Fast cellular automata with restricted inter-cell communication: Computational capacity, in: Theoretical Computer Science (IFIP TCS2006), IFIP 209 (2006), pp. 151\u2013164"},{"key":"10.1016\/j.entcs.2009.09.015_bib004","series-title":"Mathematical Foundations of Computer Science","first-page":"634","article-title":"Fast iterative arrays with restricted inter-cell communication: Constructions and decidability","volume":"4162","author":"Kutrib","year":"2006"},{"key":"10.1016\/j.entcs.2009.09.015_bib005","doi-asserted-by":"crossref","unstructured":"Kutrib, M. and A. Malcher, Bounded languages meet cellular automata with sparse communication, in: Descriptional Complexity of Formal Systems (DCFS 2009), 2009","DOI":"10.4204\/EPTCS.3.15"},{"key":"10.1016\/j.entcs.2009.09.015_bib006","series-title":"Implementation and Application of Automata","first-page":"34","article-title":"Cellular automata with sparse communication","volume":"5642","author":"Kutrib","year":"2009"},{"key":"10.1016\/j.entcs.2009.09.015_bib007","unstructured":"Seidel, S. R., Language recognition and the synchronization of cellular automata, Technical Report 79-02, Department of Computer Science, University of Iowa, Iowa City (1979)"},{"key":"10.1016\/j.entcs.2009.09.015_bib008","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/S0167-8191(00)00079-X","article-title":"Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton","volume":"27","author":"Umeo","year":"2001","journal-title":"Parallel Comput."},{"key":"10.1016\/j.entcs.2009.09.015_bib009","first-page":"257","article-title":"A design of real-time non-regular sequence generation algorithms and their implementations on cellular automata with 1-bit inter-cell communications","volume":"52","author":"Umeo","year":"2002","journal-title":"Fund. Inform."},{"key":"10.1016\/j.entcs.2009.09.015_bib010","first-page":"421","article-title":"Real-time generation of primes by a 1-bit-communication cellular automaton","volume":"58","author":"Umeo","year":"2003","journal-title":"Fund. Inform."},{"key":"10.1016\/j.entcs.2009.09.015_bib011","first-page":"181","article-title":"On cellular automata with a finite number of state changes","volume":"3","author":"Vollmar","year":"1981","journal-title":"Computing"},{"key":"10.1016\/j.entcs.2009.09.015_bib012","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/BF02084165","article-title":"Some remarks about the 'efficiency' of polyautomata","volume":"21","author":"Vollmar","year":"1982","journal-title":"Internat. J. Theoret. Phys."},{"key":"10.1016\/j.entcs.2009.09.015_bib013","series-title":"LATIN 2000: Theoretical Informatics","first-page":"417","article-title":"Linear time language recognition on cellular automata with restricted communication","volume":"1776","author":"Worsch","year":"2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109003697?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109003697?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,16]],"date-time":"2018-12-16T05:26:04Z","timestamp":1544937964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066109003697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":13,"alternative-id":["S1571066109003697"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2009.09.015","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}