{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:00:31Z","timestamp":1649062831028},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,8]]},"abstract":"<jats:p> In this paper, we introduce the notion of distributed \u03c9-automata. Distributed \u03c9-automata are a group of automata working in unison to accept an \u03c9-language. We build the theory of distributed \u03c9-automata for finite state automata and pushdown automata in different modes of cooperation like the t-mode, *-mode, = k-mode, \u2264 k-mode and \u2265 k-mode along with different acceptance criteria i.e. B\u00fcchi-, Muller-, Rabin- and Streett- acceptance criteria. We then analyze the acceptance power of such automata in all the above modes of cooperation and acceptance criteria. We present proofs that distributed \u03c9-finite state automata do not have any additional power over \u03c9-finite state automata in any of the modes of cooperation or acceptance criteria, while distributed \u03c9-pushdown automata can accept languages not in CFL<jats:sub>\u03c9<\/jats:sub>. We give proofs for the equivalence of all modes of cooperation and acceptance criteria in the case of distributed \u03c9-pushdown automata. We show that the power of distributed \u03c9-pushdown automata is equal to that of \u03c9-Turing Machines. We also study the deterministic version of distributed \u03c9-pushdown automata. Deterministic \u03c9-pushdown automata accept only languages contained in CFL<jats:sub>\u03c9<\/jats:sub> but distributed deterministic \u03c9-pushdown automata can accept languages not in CFL<jats:sub>\u03c9<\/jats:sub> and have the same power as their nondeterministic counterparts. We also define distributed completely deterministic \u03c9-pushdown automata and analyze their power. <\/jats:p>","DOI":"10.1142\/s0129054103001959","type":"journal-article","created":{"date-parts":[[2003,9,19]],"date-time":"2003-09-19T06:19:32Z","timestamp":1063952372000},"page":"681-698","source":"Crossref","is-referenced-by-count":0,"title":["Distributed \u03c9-Automata"],"prefix":"10.1142","volume":"14","author":[{"given":"Kamala","family":"Krithivasan","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai - 600036, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sharda","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai - 600036, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep V.","family":"Varma","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai - 600036, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1610"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000319"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_6"},{"key":"rf7","first-page":"1","volume":"141","author":"Rabin M. O.","journal-title":"Trans. Amer. Math. Soc."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80013-X"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80004-4"},{"key":"rf10","first-page":"1","volume":"6","author":"Cohen R. S.","journal-title":"J. Comput. System Sci."},{"key":"rf11","volume-title":"Grammar Systems: A Grammatical Approach to Distribution and Cooperation","author":"Varju E. Csuhaj","year":"1994"},{"key":"rf12","unstructured":"W.\u00a0Thomas, Handbook of Theoretical Computer Science\u00a0B, ed. P. S.\u00a0Van Leeuwen (Elsevier, 1990)\u00a0pp. 133\u2013191."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103001959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:10Z","timestamp":1565123890000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103001959"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,8]]}},"alternative-id":["10.1142\/S0129054103001959"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103001959","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}