{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:33Z","timestamp":1725493593288},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_13","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"131-140","source":"Crossref","is-referenced-by-count":0,"title":["Running Time Complexity of Printing an Acyclic Automaton"],"prefix":"10.1007","author":[{"given":"Franck","family":"Guingne","sequence":"first","affiliation":[]},{"given":"Andr\u00e9","family":"Kempe","sequence":"additional","affiliation":[]},{"given":"Florent","family":"Nicart","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"13_CR1","unstructured":"Berstel, J. 1989. Finite Automata and Rational Languages. An Introduction, in Formal Properties of Finite Automata and Applications. In J.-E. Pin, editor, Lecture Notes in Computer Science, number 386. Verlag, 1989 edition, pages 2\u201314."},{"issue":"1\u20132","key":"13_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0304-3975(97)00296-X","volume":"233","author":"P. Caron","year":"2000","unstructured":"Caron, P. and D. Ziadi. 2000. Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1\u20132):75\u201390.","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR3","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S. 1974. Automata, Languages, and Machines, volume A. Academic Press, San Diego, CA, USA."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-45526-4_9","volume":"2214","author":"D. Giammarresi","year":"2001","unstructured":"Giammarresi, D., J.-L. Ponty, and D. Wood. 2001. Thompson digraphs: A characterization, in WIA\u201999. Lecture Notes in Computer Science, 2214:91\u2013100.","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR5","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"2001","unstructured":"Hopcroft, J. E, R. Motwani, and J. D Ullman. 2001. Introduction to Automata Theory, Languages and Computation. Low Price Edition. Addison Wesley Longman, Inc, Reading, Mass., USA, 2 edition.","edition":"2 edition"},{"key":"13_CR6","unstructured":"Nicaud, C. 2000. \u00c9tude du comportement en moyenne des automates finis et des languages rationnels. Thesis, University of Paris 7."},{"key":"13_CR7","first-page":"1","volume-title":"Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics","author":"D. Perrin","year":"1990","unstructured":"Perrin, D. 1990. Finite automata. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B: Formal Models and Semantics. Elsevier, Amsterdam, pages 1\u201357."},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Q. Zhuang, and K. Salomaa. 1994. The state complexities of some basic operations on regular languages. Theoret. Comput. Sci., 125(2):315\u2013328.","journal-title":"Theoret. Comput. Sci."}],"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-45089-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T10:53:20Z","timestamp":1551005600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}