{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:30Z","timestamp":1725492390848},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_21","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"221-227","source":"Crossref","is-referenced-by-count":2,"title":["automata, a Hybrid System for Computational Automata Theory"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Sutner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"21_CR1","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":"21_CR2","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":"21_CR3","unstructured":"G. Glass and B. Schuchert. The STL Primer. Prentice Hall, 1996."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"D. Kozen. Lower bounds for natural proof systems. In Proc. 18-th Ann. Symp. on Foundations of Computer Science, pages 254\u2013266. IEEE Computer Society, 1977.","DOI":"10.1109\/SFCS.1977.16"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"D. Lind and B. Marcus. Introduction to Symbolic Dynamics and Coding. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511626302"},{"key":"21_CR6","unstructured":"R. Raymond, D. Wood, and S. Yu. First International Workshop on Implementing Automata, volume 1260 of Lecture Notes in CS. Springer Verlag, 1997."},{"key":"21_CR7","unstructured":"B. Stroustrup. The C++ Programming Language. Addison-Wesley, 1997."},{"issue":"1","key":"21_CR8","first-page":"78","volume":"2","author":"K. Sutner","year":"1992","unstructured":"K. Sutner. Finite state machines and syntactic semigroups. The Mathematica Journal, 2(1):78\u201387, 1992.","journal-title":"The Mathematica Journal"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"K. Sutner. Implementing finite state machines. In N. Dean and G. Shannon, editors, Computational Support for Discrete Mathematics, volume 15, pages 347\u2013365. DIMACS, 1994.","DOI":"10.1090\/dimacs\/015\/24"},{"issue":"11","key":"21_CR10","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":"21_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0304-3975(97)00242-9","volume":"230","author":"K. Sutner","year":"2000","unstructured":"K. Sutner. \u03c3-automata and Chebyshev polynomials. Theoretical Computer Science, 230:49\u201373, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"21_CR12","first-page":"245","volume":"13","author":"K. Sutner","year":"2001","unstructured":"K. Sutner. Decomposition of additive cellular automata. Complex Systems, 13(3):245\u2013270, 2001.","journal-title":"Complex Systems"},{"key":"21_CR13","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":"21_CR14","volume-title":"The Mathematica Book","author":"S. Wolfram","year":"1999","unstructured":"S. Wolfram. The Mathematica Book. Wolfram Media, Cambridge UP, 4th edition, 1999.","edition":"4th edition"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T06:46:13Z","timestamp":1550990773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}