{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:44Z","timestamp":1725492404689},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_18","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"194-202","source":"Crossref","is-referenced-by-count":1,"title":["Reduced Power Automata"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Sutner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"18_CR1","unstructured":"E. Badouel. Representations of reversible automata and state graphs of vector addition systems. Technical Report 3490, INRIA, 1998."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"M.-P. Beal and D. Perrin. Symbolic dynamics and finite automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 2, chapter 10. Springer Verlag, 1997.","DOI":"10.1007\/978-3-662-07675-0_10"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0304-3975(89)90022-4","volume":"67","author":"D. Beauquier","year":"1989","unstructured":"D. Beauquier. Minimal automaton for a factorial, transitive, rational language. Theoretical Computer Science, 67:65\u201373, 1989.","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"M. Delorme and J. Mazoyer. Cellular Automata: A Parallel Model, volume 460 of Mathematics and Its Applications. Kluwer Academic Publishers, 1999.","DOI":"10.1007\/978-94-015-9153-9"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01319913","volume":"80","author":"R. Fischer","year":"1975","unstructured":"R. Fischer. Sofic systems and graphs. Monatshefte f\u00fcr Mathematik, 80:179\u2013186, 1975.","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"G. A. Hedlund","year":"1969","unstructured":"G. A. Hedlund. Endomorphisms and automorphisms of the shift dynamical system. Math. Systems Theory, 3:320\u2013375, 1969.","journal-title":"Math. Systems Theory"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"D. Lind and B. Marcus. Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511626302"},{"issue":"1","key":"18_CR8","first-page":"19","volume":"5","author":"K. Sutner","year":"1991","unstructured":"K. Sutner. De Bruijn graphs and linear cellular automata. Complex Systems, 5(1): 19\u201330, 1991.","journal-title":"Complex Systems"},{"issue":"11","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1016\/S0167-8191(97)00080-X","volume":"23","author":"K. Sutner","year":"1997","unstructured":"K. Sutner. Linear cellular automata and Fischer automata. Parallel Computing, 23(11):1613\u20131634, 1997.","journal-title":"Parallel Computing"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"K. Sutner. Linear Cellular Automata and De Bruijn Automata, pages 303\u2013320. Volume 460 of Mathematics and Its Applications [4], 1999.","DOI":"10.1007\/978-94-015-9153-9_12"},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/3-540-44683-4_58","volume-title":"Mathematical Foundations of Computer Science","author":"K. Sutner","year":"2001","unstructured":"K. Sutner. The size of power automata. In J. Sgall, Ales Pultr, and Petr Kolman, editors, Mathematical Foundations of Computer Science, volume 2136 of SLNCS, pages 666\u2013677, 2001."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/BF01295322","volume":"77","author":"B. Weiss","year":"1973","unstructured":"B. Weiss. Subshifts of finite type and sofic systems. Monatshefte f\u00fcr Mathematik, 77:462\u2013474, 1973.","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1088\/0031-8949\/1985\/T9\/029","volume":"T9","author":"S. Wolfram","year":"1985","unstructured":"S. Wolfram. Twenty problems in the theory of cellular automata. Physica Scripta, T9:170\u2013183, 1985.","journal-title":"Physica Scripta"},{"key":"18_CR14","unstructured":"S. Wolfram. Theory and Applications of Cellular Automata. World Scientific, 1986."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"S. Wolfram. A New Kind of Science. Wolfram Media, 2002.","DOI":"10.1115\/1.1553433"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:23:39Z","timestamp":1556915019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}