{"id":"https://openalex.org/W2056592968","doi":"https://doi.org/10.4204/eptcs.3.15","title":"Bounded Languages Meet Cellular Automata with Sparse Communication","display_name":"Bounded Languages Meet Cellular Automata with Sparse Communication","publication_year":2009,"publication_date":"2009-07-30","ids":{"openalex":"https://openalex.org/W2056592968","doi":"https://doi.org/10.4204/eptcs.3.15","mag":"2056592968"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.3.15","doi":"https://doi.org/10.4204/eptcs.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.3.15","pdf_url":"https://arxiv.org/pdf/0907.5128","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://arxiv.org/pdf/0907.5128","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026803820","display_name":"Martin Kutrib","orcid":"https://orcid.org/0000-0002-9564-2625","observed_orcids":["https://orcid.org/0000-0002-9564-2625"]},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Kutrib","raw_affiliation_strings":["Institut f\u00fcr Informatik - Universit\u00e4t Giessen Arndtstr. 2 -35392 Giessen - Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik - Universit\u00e4t Giessen Arndtstr. 2 -35392 Giessen - Germany","institution_ids":["https://openalex.org/I200763008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083650443","display_name":"Andreas Malcher","orcid":"https://orcid.org/0000-0002-9589-5833","observed_orcids":["https://orcid.org/0000-0002-9589-5833"]},"institutions":[{"id":"https://openalex.org/I200763008","display_name":"Justus-Liebig-Universit\u00e4t Gie\u00dfen","ror":"https://ror.org/033eqas34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200763008"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Malcher","raw_affiliation_strings":["Institut f\u00fcr Informatik - Universit\u00e4t Giessen Arndtstr. 2 -35392 Giessen - Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik - Universit\u00e4t Giessen Arndtstr. 2 -35392 Giessen - Germany","institution_ids":["https://openalex.org/I200763008"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200763008"],"apc_list":null,"apc_paid":null,"fwci":0.32,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62710419,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"163","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.951200008392334,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.951200008392334,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.047200001776218414,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cellular-automata","display_name":"cellular automata","score":0.8799999952316284},{"id":"https://openalex.org/keywords/bounded-languages","display_name":"bounded languages","score":0.8180000185966492},{"id":"https://openalex.org/keywords/sparse-communication","display_name":"sparse communication","score":0.8880000114440918},{"id":"https://openalex.org/keywords/decidability","display_name":"decidability","score":0.7910000085830688},{"id":"https://openalex.org/keywords/undecidability","display_name":"undecidability","score":0.949999988079071}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6978999972343445},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5327000021934509},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.508400022983551},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4984000027179718},{"id":"https://openalex.org/C75745568","wikidata":"https://www.wikidata.org/wiki/Q5165519","display_name":"Continuous spatial automaton","level":5,"score":0.45579999685287476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4372999966144562},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.43160000443458557},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4212999939918518},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C192499940","wikidata":"https://www.wikidata.org/wiki/Q17022326","display_name":"Stochastic cellular automaton","level":3,"score":0.35530000925064087},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3528999984264374},{"id":"https://openalex.org/C13743347","wikidata":"https://www.wikidata.org/wiki/Q4812203","display_name":"Asynchronous cellular automaton","level":5,"score":0.33059999346733093},{"id":"https://openalex.org/C181266644","wikidata":"https://www.wikidata.org/wiki/Q7318293","display_name":"Reversible cellular automaton","level":5,"score":0.30300000309944153},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2833000123500824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2705000042915344},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.2685999870300293},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C68576872","wikidata":"https://www.wikidata.org/wiki/Q4893239","display_name":"Quantum cellular automaton","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2605000138282776}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4204/eptcs.3.15","doi":"https://doi.org/10.4204/eptcs.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.3.15","pdf_url":"https://arxiv.org/pdf/0907.5128","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0907.5128","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/0907.5128","pdf_url":"https://arxiv.org/pdf/0907.5128","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:8780ac88909e4fbaaff341fe77db4fb0","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/8780ac88909e4fbaaff341fe77db4fb0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 163-172 (2009)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.4204/eptcs.3.15","doi":"https://doi.org/10.4204/eptcs.3.15","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.3.15","pdf_url":"https://arxiv.org/pdf/0907.5128","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2056592968.pdf","grobid_xml":"https://content.openalex.org/works/W2056592968.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W68320400","https://openalex.org/W1522601122","https://openalex.org/W1571704443","https://openalex.org/W1602644390","https://openalex.org/W1945859206","https://openalex.org/W1970863182","https://openalex.org/W1971747251","https://openalex.org/W1988560957","https://openalex.org/W1995893260","https://openalex.org/W1998830009","https://openalex.org/W2023999667","https://openalex.org/W2032543301","https://openalex.org/W2054226733","https://openalex.org/W2061759138","https://openalex.org/W2078011493","https://openalex.org/W2098951701","https://openalex.org/W2133239595","https://openalex.org/W2170566806","https://openalex.org/W6624977845","https://openalex.org/W6685277063"],"related_works":[],"abstract_inverted_index":{"Cellular":[0],"automata":[1,66],"are":[2,95,115],"one-dimensional":[3],"arrays":[4],"of":[5,13,35,38,64,101,110,128],"interconnected":[6],"interacting":[7],"finite":[8],"automata.":[9],"We":[10],"investigate":[11],"one":[12],"the":[14,17,33,39,46,57,99,108,111,125],"weakest":[15],"classes,":[16],"real-time":[18],"one-way":[19],"cellular":[20,65],"automata,":[21],"and":[22],"impose":[23],"an":[24],"additional":[25],"restriction":[26],"on":[27],"their":[28],"inter-cell":[29],"communication":[30],"by":[31],"bounding":[32],"number":[34,100,127],"allowed":[36],"uses":[37],"links":[40],"between":[41],"cells.":[42],"Moreover,":[43],"we":[44],"consider":[45],"devices":[47,75],"as":[48],"acceptors":[49],"for":[50,122],"bounded":[51,92],"languages":[52,93],"in":[53,107],"order":[54],"to":[55],"explore":[56],"borderline":[58],"at":[59,104],"which":[60],"non-trivial":[61],"decidability":[62],"problems":[63,114],"classes":[67,123],"become":[68],"decidable.":[69],"It":[70],"is":[71,103,120,133],"shown":[72],"that":[73,80,94],"even":[74],"with":[76],"drastically":[77],"reduced":[78],"communication,":[79],"is,":[81],"each":[82],"two":[83],"neighboring":[84],"cells":[85],"may":[86],"communicate":[87],"only":[88],"constantly":[89],"often,":[90],"accept":[91],"not":[96],"semilinear.":[97],"If":[98],"communications":[102,129],"least":[105],"logarithmic":[106],"length":[109],"input,":[112],"several":[113],"undecidable.":[116],"The":[117],"same":[118],"result":[119],"obtained":[121],"where":[124],"total":[126],"during":[130],"a":[131],"computation":[132],"linearly":[134],"bounded.":[135]},"counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2016-06-24T00:00:00"}