{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:46:44Z","timestamp":1775839604360,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(96)00058-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"81-115","source":"Crossref","is-referenced-by-count":17,"title":["Sofic shifts with synchronizing presentations"],"prefix":"10.1016","volume":"158","author":[{"given":"Nata\u0161a","family":"Jonoska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00058-8_BIB1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-3975(89)90022-4","article-title":"Minimal automaton for factorial transitive and rational languages","volume":"67","author":"Beauquier","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)00058-8_BIB2","series-title":"Automata on Infinite Words","first-page":"138","article-title":"Languages and Subshifts","volume":"Vol. 192","author":"Blanchard","year":"1984"},{"key":"10.1016\/0304-3975(96)00058-8_BIB3","first-page":"403","article-title":"A note on minimal covers for sofic systems","volume":"95","author":"Boyle","year":"1985"},{"key":"10.1016\/0304-3975(96)00058-8_BIB4","series-title":"Symbolic Dynamics and its Applications","first-page":"139","article-title":"Covers for coded systems","volume":"Vol. 135","author":"Fiebig","year":"1992"},{"key":"10.1016\/0304-3975(96)00058-8_BIB5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01319913","article-title":"Sofic systems and graphs","volume":"80","author":"Fischer","year":"1975","journal-title":"Monatsh. Math."},{"key":"10.1016\/0304-3975(96)00058-8_BIB6","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01691062","article-title":"Endomorphisms and automorphisms of the shift dynamical system","volume":"3","author":"Hedlund","year":"1969","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(96)00058-8_BIB7","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(96)00058-8_BIB8","unstructured":"N. Jonoska, Deciding equality of irreducible sofic shifts, manuscript."},{"key":"10.1016\/0304-3975(96)00058-8_BIB9","doi-asserted-by":"crossref","first-page":"1818","DOI":"10.1109\/18.340457","article-title":"Minimal presentations for irreducible sofic shifts","volume":"40","author":"Jonoska","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(96)00058-8_BIB10","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02760631","article-title":"On sofic systems I","volume":"48","author":"Krieger","year":"1984","journal-title":"Israel J. Math."},{"key":"10.1016\/0304-3975(96)00058-8_BIB11","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0304-3975(96)00058-8_BIB12","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/18.79945","article-title":"Bounds on the number of states in encoders graphs for input-constrained channels","volume":"IT-37","author":"Marcus","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(96)00058-8_BIB13","series-title":"Sequences II \u2014 Methods in Communication Security and Computer Science","first-page":"470","article-title":"Synchronizing automata","author":"Perrin","year":"1993"},{"key":"10.1016\/0304-3975(96)00058-8_BIB14","series-title":"Symbolic Dynamics and its Applications","first-page":"295","article-title":"Synchronizing prefix codes and automata and the road coloring problem","volume":"Vol. 135","author":"Perrin","year":"1992"},{"key":"10.1016\/0304-3975(96)00058-8_BIB15","series-title":"Varieties of Formal Languages","author":"Pin","year":"1986"},{"key":"10.1016\/0304-3975(96)00058-8_BIB16","first-page":"55","article-title":"Sur Certaines Op\u00e9rations de Fermeture Dans les Language Rationnels","volume":"1","author":"Sch\u00fctzenberger","year":"1974","journal-title":"RAIRO Inform. Theory"},{"key":"10.1016\/0304-3975(96)00058-8_BIB17","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/BF01295322","article-title":"Subshifts of finite type and sofic systems","volume":"77","author":"Weiss","year":"1973","journal-title":"Monatsh. Math."},{"key":"10.1016\/0304-3975(96)00058-8_BIB18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-322-96657-5_5","article-title":"Models for dynamics","volume":"2","author":"Willems","year":"1989","journal-title":"Dynamics Reported"},{"key":"10.1016\/0304-3975(96)00058-8_BIB19","series-title":"Theory and Applications of Cellular Automata","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:55:46Z","timestamp":1555376146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397596000588"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00058-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}