{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:04:43Z","timestamp":1754193883930,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946306"},{"type":"electronic","value":"9783319946313"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94631-3_8","type":"book-chapter","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T06:09:52Z","timestamp":1531202992000},"page":"88-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs"],"prefix":"10.1007","author":[{"given":"Miguel","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","volume":"387","author":"M Almeida","year":"2007","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2), 93\u2013102 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"VM Antimirov","year":"1996","unstructured":"Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"8_CR3","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. 381(1\u20133), 86\u2013104 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.tcs.2004.03.072","volume":"330","author":"JM Champarnaud","year":"2005","unstructured":"Champarnaud, J.M., Parantho\u00ebn, T.: Random generation of DFAs. Theor. Comput. Sci. 330(2), 221\u2013235 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR5","unstructured":"FAdo, P.: FAdo: tools for formal languages manipulation. http:\/\/fado.dcc.up.pt. Accessed 13 2018"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-319-22360-5_12","volume-title":"Implementation and Application of Automata","author":"P-C H\u00e9am","year":"2015","unstructured":"H\u00e9am, P.-C., Joly, J.-L.: On the uniform random generation of non deterministic automata up\u00a0to isomorphism. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 140\u2013152. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22360-5_12"},{"key":"8_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 2nd edn. Addison Wesley, Boston (1981)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chain and Mixing Times. American Mathematical Society (2008). http:\/\/pages.uoregon.edu\/dlevin\/MARKOV\/markovmixing.pdf","DOI":"10.1090\/mbk\/058"},{"key":"8_CR9","unstructured":"Lothaire, M.: Applied Combinatorics on Words, vol. 105. Encyclopedia of Mathematics and its Applications. Cambridge University Press, New York (2005)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-662-44522-8_2","volume-title":"Mathematical Foundations of Computer Science 2014","author":"C Nicaud","year":"2014","unstructured":"Nicaud, C.: Random deterministic automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 5\u201323. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_2"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94631-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:16:15Z","timestamp":1710324975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94631-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946306","9783319946313"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94631-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Halifax, NS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.smu.ca\/~dcfs2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}