{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:25:46Z","timestamp":1649064346643},"reference-count":23,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.3.15","type":"journal-article","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T03:05:31Z","timestamp":1248923131000},"page":"163-172","source":"Crossref","is-referenced-by-count":1,"title":["Bounded Languages Meet Cellular Automata with Sparse Communication"],"prefix":"10.4204","volume":"3","author":[{"given":"Martin","family":"Kutrib","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Malcher","sequence":"additional","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2009,7,30]]},"reference":[{"key":"Book:1974:tlcc","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"R. V. Book","year":"1974","journal-title":"Inform. Control"},{"key":"Choffrut:1984:RTCATA","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00264617","article-title":"On real-time cellular automata and trellis automata","volume":"21","author":"C. Choffrut","year":"1984","journal-title":"Acta Inform."},{"key":"Chrobak:1986:FAUL","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","article-title":"Finite automata and unary languages","volume":"47","author":"M. Chrobak","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"csuhajvarju:1994:gs","volume-title":"Grammar Systems: A Grammatical Approach to Distribution and Cooperation","author":"E. Csuhaj-Varj\u00fa","year":"1984"},{"key":"Ginsburg:1966:MTCFL","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966"},{"key":"ibarra:1970:sml","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0019-9958(70)80034-1","article-title":"Simple matrix languages","volume":"17","author":"O. H. Ibarra","year":"1970","journal-title":"Inform. Control"},{"key":"ibarra:1974:nslsbrmhpda","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","article-title":"A note on semilinear sets and bounded-reversal multihead pushdown automata","volume":"3","author":"O. H. Ibarra","year":"1974","journal-title":"Inform. Process. Lett."},{"key":"ibarra:1978:rbmcmdp","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"O. H. Ibarra","year":"1978","journal-title":"J. ACM"},{"key":"klein:2007:cdul","first-page":"343","article-title":"Cellular devices and unary languages","volume":"78","author":"A. Klein","year":"2007","journal-title":"Fund. Inform."},{"key":"kutrib:2008:ca-cpv","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-540-78291-9_6","article-title":"Cellular automata -- a computational point of view","volume-title":"New Developments in Formal Languages and Applications","author":"M. Kutrib","year":"2008"},{"key":"kutrib:2009:calt","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30440-3_54","article-title":"Cellular automata and language theory","volume-title":"Encyclopedia of Complexity and System Science","author":"M. Kutrib","year":"2009"},{"key":"Kutrib:2006:fcaricccc","series-title":"IFIP","first-page":"151","article-title":"Fast cellular automata with restricted inter-cell communication: Computational capacity","volume-title":"Theoretical Computer Science (IFIP TCS2006)","volume":"209","author":"M. Kutrib","year":"2006"},{"key":"Kutrib:2009:cssc:proc","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/978-3-642-02979-0_7","article-title":"Cellular automata with sparse communication","volume-title":"Conference on Implementation and Applications of Automata (CIAA 2009)","volume":"5642","author":"M. Kutrib","year":"2009"},{"key":"Malcher:2002:dccadq","first-page":"549","article-title":"Descriptional complexity of cellular automata and decidability questions","volume":"7","author":"A. Malcher","year":"2002","journal-title":"J. Autom., Lang. Comb."},{"key":"Mazoyer:1994:SODCA","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0304-3975(98)00150-9","article-title":"Signals in one-dimensional cellular automata","volume":"217","author":"J. Mazoyer","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"Mereghetti:2001:osbua","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1137\/S009753979935431X","article-title":"Optimal simulations between unary automata","volume":"30","author":"C. Mereghetti","year":"2001","journal-title":"SIAM J. Comput."},{"key":"Pighizzini:2002:uloscjf","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1142\/S012905410200100X","article-title":"Unary language operations, state complexity and Jacobsthal's function","volume":"13","author":"G. Pighizzini","year":"2002","journal-title":"Int. J. Found. Comput. Sci."},{"key":"Seidel:1979:LRSCA","volume-title":"Language recognition and the synchronization of cellular automata","author":"S. R. Seidel","year":"1979"},{"key":"Umeo:2001:ltrcbi","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":"H. Umeo","year":"2001","journal-title":"Parallel Comput."},{"key":"Umeo:2003:rtgpob","first-page":"421","article-title":"Real-time generation of primes by a 1-bit-communication cellular automaton","volume":"58","author":"H. Umeo","year":"2003","journal-title":"Fund. Inform."},{"key":"Umeo:1982:DOWSTWRTCARP","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0020-0190(82)90028-X","article-title":"Deterministic one-way simulation of two-way real-time cellular automata and its related problems","volume":"14","author":"H. Umeo","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"Vollmar:1981:CAFN","first-page":"181","article-title":"On cellular automata with a finite number of state changes","volume":"3","author":"R. Vollmar","year":"1981","journal-title":"Computing"},{"key":"Worsch:2000ltlrcarc","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/10719839_41","article-title":"Linear time language recognition on cellular automata with restricted communication","volume-title":"Theoretical Informatics (LATIN 2000)","volume":"1776","author":"T. Worsch","year":"2000"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T06:00:07Z","timestamp":1550815207000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/0907.5128v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,30]]},"references-count":23,"URL":"https:\/\/doi.org\/10.4204\/eptcs.3.15","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,30]]}}}