{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:02:47Z","timestamp":1754193767979},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_8","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:03:04Z","timestamp":1370206984000},"page":"88-99","source":"Crossref","is-referenced-by-count":3,"title":["Random Generation of Deterministic Acyclic Automata Using the Recursive Method"],"prefix":"10.1007","author":[{"given":"Sven","family":"De Felice","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Akhavi, A., Klimann, I., Lombardy, S., Mairesse, J., Picantin, M.: On the finiteness problem for automaton (semi)groups. IJAC\u00a022(6) (2012)","DOI":"10.1142\/S021819671250052X"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1142\/S0129054108005930","volume":"19","author":"M. Almeida","year":"2008","unstructured":"Almeida, M., Moreira, N., Reis, R.: Exact generation of minimal acyclic deterministic finite automata. Int. J. Found. Comput. Sci.\u00a019(4), 751\u2013765 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"8_CR3","unstructured":"Antonenko, A.S.: On transition function of mealy automata with finite growth. Matematychni Studii\u00a029(1) (2008)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2012.04.025","volume":"450","author":"V. Carnino","year":"2012","unstructured":"Carnino, V., De Felice, S.: Sampling different kinds of acyclic automata using Markov chains. TCS\u00a0450, 31\u201342 (2012)","journal-title":"TCS"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45005-X_18","volume-title":"Developments in Language Theory","author":"M. Domaratzki","year":"2003","unstructured":"Domaratzki, M.: Improved bounds on the number of automata accepting finite languages. In: Ito, M., Toyama, M. (eds.) DLT 2002. LNCS, vol.\u00a02450, pp. 209\u2013219. Springer, Heidelberg (2003)"},{"issue":"4","key":"8_CR6","first-page":"469","volume":"7","author":"M. Domaratzki","year":"2002","unstructured":"Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics\u00a07(4), 469\u2013486 (2002)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Cambridge Univ. Pr. (2009)","DOI":"10.1017\/CBO9780511801655"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P. Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmermann, P., Cutsem, B.V.: A calculus for the random generation of labelled combinatorial structures. TCS\u00a0132(2), 1\u201335 (1994)","journal-title":"TCS"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/j.dam.2005.06.009","volume":"154","author":"V.A. Liskovets","year":"2006","unstructured":"Liskovets, V.A.: Exact enumeration of acyclic deterministic automata. Discrete Applied Mathematics\u00a0154(3), 537\u2013551 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR10","unstructured":"Nijenhuis, A., Wilf, H.: Combinatorial algorithms. Computer Science and Applied Mathematics. Academic Press (1975), \n                    \n                      http:\/\/bks9.books.google.fr\/books?id=09BQAAAAMAAJ"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Stanley, R.P.: Enumerative Combinatorics, Cambridge Univ. Pr. (2000)","DOI":"10.1017\/CBO9780511609589"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:58:29Z","timestamp":1557752309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}