{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T20:45:23Z","timestamp":1698007523177},"reference-count":8,"publisher":"Wiley","issue":"12","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":7384,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp;amp; Computers in Japan"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Advancement of VLSI technology accelerates studies in parallel computation. These are studies of such parallel algorithms as recognition of language, sorting, matrix calculations and graph processing, of one\u2010way cellular automata (systolic arrays), iterative arrays, tree structure cell automata, and bounded cellular automata, etc., the goal of which is to devise simpler and faster networks. So far, systolic arrays have attracted considerable attention from theoretical as well as practical viewpoints. On the other hand, bounded cellular automata seemingly have not stimulated much interest. This paper shows that bounded cellular automata process recognition of languages faster than one\u2010way automata.<\/jats:p>","DOI":"10.1002\/scj.4690181210","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T13:29:42Z","timestamp":1183814982000},"page":"92-102","source":"Crossref","is-referenced-by-count":0,"title":["Faster recognition of languages for bounded cellular automata"],"prefix":"10.1002","volume":"18","author":[{"given":"Hiromi","family":"Miyajima","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(72)80004-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90164-3"},{"key":"e_1_2_1_4_2","unstructured":"K.Culik J.GruskaandA.Salomaa.Systolic trellis automata (VLSI) Research Report CS\u201081\u201034 Dept. of Comp. Sci. University of Waterloo (1981)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264617"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90028-X"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(81)90598-2"},{"issue":"11","key":"e_1_2_1_8_2","first-page":"1842","article-title":"Language and Recognition by Systolic Automata","volume":"69","author":"Miyajima H.","year":"1986","journal-title":"Trans. I. E. C. E., Japan"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1969.222663"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690181210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690181210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T03:50:27Z","timestamp":1697860227000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690181210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":8,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/scj.4690181210"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690181210","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}