{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:18:03Z","timestamp":1648617483217},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p> The state complexity of the cover language of sofic shifts arising from cellular automata is studied. It is shown that in the case where the underlying automaton is nearly a permutation automaton the deterministic automaton obtained by the classical Rabin-Scott construction is already reduced. <\/jats:p>","DOI":"10.1142\/s0129054103002217","type":"journal-article","created":{"date-parts":[[2003,12,19]],"date-time":"2003-12-19T05:51:21Z","timestamp":1071813081000},"page":"1117-1128","source":"Crossref","is-referenced-by-count":0,"title":["REDUCED POWER AUTOMATA AND SOFIC SYSTEMS"],"prefix":"10.1142","volume":"14","author":[{"given":"KLAUS","family":"SUTNER","sequence":"first","affiliation":[{"name":"Computer Science Department,  Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","volume-title":"Handbook of Formal Languages","volume":"2","author":"Beal M.-P.","year":"1997"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90022-4"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9153-9"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01319913"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691062"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302"},{"key":"rf8","first-page":"19","volume":"5","author":"Sutner K.","journal-title":"Complex Systems"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(97)00080-X"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9153-9_12"},{"key":"rf11","unstructured":"K.\u00a0Sutner, Mathematical Foundations of Computer Science, SLNCS\u00a02136, eds. J.\u00a0Sgall, A.les\u00a0Pultr and P.etr\u00a0Kolman (2001)\u00a0pp. 666\u2013677."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01295322"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01217347"},{"key":"rf14","first-page":"170","volume":"9","author":"Wolfram S.","journal-title":"Physica Scripta"},{"key":"rf15","volume-title":"Theory and Applications of Cellular Automata","author":"Wolfram S.","year":"1986"},{"key":"rf16","volume-title":"A New Kind of Science","author":"Wolfram S.","year":"2002"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103002217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:26:02Z","timestamp":1565191562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103002217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":15,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0129054103002217"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103002217","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}