{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:17:52Z","timestamp":1725596272899},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_7","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"65-75","source":"Crossref","is-referenced-by-count":3,"title":["Random Generation of Deterministic Acyclic Automata Using Markov Chains"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Carnino","sequence":"first","affiliation":[]},{"given":"Sven","family":"De Felice","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_CR1","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."},{"issue":"1-3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.04.001","volume":"381","author":"F. Bassino","year":"2007","unstructured":"Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci.\u00a0381(1-3), 86\u2013104 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-02979-0_23","volume-title":"Implementation and Application of Automata","author":"P. Caron","year":"2009","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Small Extended Expressions for Acyclic Automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 198\u2013207. Springer, Heidelberg (2009)"},{"issue":"38-39","key":"7_CR4","doi-asserted-by":"publisher","first-page":"3423","DOI":"10.1016\/j.tcs.2010.05.023","volume":"411","author":"P. Caron","year":"2010","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Acyclic automata and small expressions using multi-tilde-bar operators. Theor. Comput. Sci.\u00a0411(38-39), 3423\u20133435 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"7_CR5","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., Ziadi, D.: Characterization of glushkov automata. Theor. Comput. Sci.\u00a0233(1-2), 75\u201390 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.tcs.2004.03.072","volume":"330","author":"J.-M. Champarnaud","year":"2005","unstructured":"Champarnaud, J.-M., Parantho\u00ebn, T.: Random generation of DFAs. Theor. Comput. Sci.\u00a0330(2), 221\u2013235 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4-5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1017\/S0963548304006315","volume":"13","author":"P. Duchon","year":"2004","unstructured":"Duchon, P., Flajolet, P., Louchard, G., Schaeffer, G.: Boltzmann samplers for the random generation of combinatorial structures. Combinatorics, Probability & Computing\u00a013(4-5), 577\u2013625 (2004)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"2","key":"7_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., Van Cutsem, B.: A calculus for the random generation of labelled combinatorial structures. Theor. Comput. Sci.\u00a0132(2), 1\u201335 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"38-39","key":"7_CR9","doi-asserted-by":"publisher","first-page":"3469","DOI":"10.1016\/j.tcs.2010.05.036","volume":"411","author":"P.-C. H\u00e9am","year":"2010","unstructured":"H\u00e9am, P.-C., Nicaud, C., Schmitz, S.: Parametric random generation of deterministic tree automata. Theor. Comput. Sci.\u00a0411(38-39), 3469\u20133480 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR10","volume-title":"Markov Chains and Mixing Times","author":"A. David","year":"2008","unstructured":"David, A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS, Providence (2008)"},{"issue":"3","key":"7_CR11","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":"7_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S1571-0653(04)00394-4","volume":"10","author":"G. Melan\u00e7on","year":"2001","unstructured":"Melan\u00e7on, G., Dutour, I., Bousquet-M\u00e9lou, M.: Random generation of directed acyclic graphs. Electronic Notes in Discrete Mathematics\u00a010, 202\u2013207 (2001)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ipl.2003.06.002","volume":"90","author":"G. Melan\u00e7on","year":"2004","unstructured":"Melan\u00e7on, G., Philippe, F.: Generating connected acyclic digraphs uniformly at random. Inf. Process. Lett.\u00a090(4), 209\u2013213 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR14","first-page":"217","volume":"4","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: String-matching with automata. Nord. J. Comput.\u00a04(2), 217\u2013231 (1997)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theor. Comput. Sci.\u00a092(1), 181\u2013189 (1992)","journal-title":"Theor. 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\/978-3-642-22256-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:40:09Z","timestamp":1553928009000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}