{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T06:54:56Z","timestamp":1777100096852,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540243182","type":"print"},{"value":"9783540305002","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_15","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"156-166","source":"Crossref","is-referenced-by-count":11,"title":["The Generalization of Generalized Automata: Expression Automata"],"prefix":"10.1007","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/PGEC.1963.263416","volume":"EC-12","author":"J. Brzozowski","year":"1963","unstructured":"Brzozowski, J., McCluskey Jr., E.: Signal flow graph techniques for sequential circuit state diagrams. IEEE Transactions on Electronic Computers\u00a0EC-12, 67\u201376 (1963)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1142\/S0129054103002151","volume":"14","author":"J. Czyzowicz","year":"2003","unstructured":"Czyzowicz, J., Fraczak, W., Pelc, A., Rytter, W.: Linear-time prime decomposition of regular prefix codes. International Journal of Foundations of Computer Science\u00a014, 1019\u20131032 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"15_CR3","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(97)00166-7","volume":"215","author":"D. Giammarresi","year":"1999","unstructured":"Giammarresi, D., Montalbano, R.: Deterministic generalized automata. Theoretical Comput. Sci.\u00a0215, 191\u2013208 (1999)","journal-title":"Theoretical Comput. Sci."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, New York","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"15_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (1979)","edition":"2"},{"issue":"3","key":"15_CR7","first-page":"339","volume":"15","author":"A. Mateescu","year":"2002","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Factorizations of languages and commutativity conditions. Acta Cybernetica\u00a015(3), 339\u2013351 (2002)","journal-title":"Acta Cybernetica"},{"key":"15_CR8","first-page":"129","volume-title":"Automata Studies","author":"E. Moore","year":"1956","unstructured":"Moore, E.: Gedanken experiments on sequential machines. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 129\u2013153. Princeton University Press, Princeton (1956)"},{"key":"15_CR9","series-title":"Handbook of Theoretical Computer Science","first-page":"1","volume-title":"Formal Models and Semantics","author":"D. Perrin","year":"1990","unstructured":"Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Formal Models and Semantics. Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 1\u201357. The MIT Press, Cambridge (1990)"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1142\/9789812792464_0003","volume-title":"Developments in Language Theory (DLT 1999)","author":"A. Salomaa","year":"2000","unstructured":"Salomaa, A., Yu, S.: On the decomposition of finite languages. In: Rozenberg, G., Thomas, W. (eds.) Developments in Language Theory (DLT 1999), pp. 22\u201331. World Scientific, Singapore (2000)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L., Meyer, A.: Word problems requiring exponential time. In: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"15_CR12","volume-title":"Theory of Computation","author":"D. Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. John Wiley & Sons, Inc., New York (1987)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:09Z","timestamp":1605761829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}