{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:36:52Z","timestamp":1648895812896},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T00:00:00Z","timestamp":1370304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s11227-013-0957-0","type":"journal-article","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T15:38:37Z","timestamp":1370273917000},"page":"710-722","source":"Crossref","is-referenced-by-count":0,"title":["The number of DFAs for a given spanning tree"],"prefix":"10.1007","volume":"65","author":[{"given":"P.","family":"Babaali","sequence":"first","affiliation":[]},{"given":"E.","family":"Carta-Gerardino","sequence":"additional","affiliation":[]},{"given":"C.","family":"Knaplund","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,4]]},"reference":[{"issue":"2","key":"957_CR1","doi-asserted-by":"crossref","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 (2007) Enumeration and generation with a string automata representation. Theor Comput Sci 387(2):93\u2013102","journal-title":"Theor Comput Sci"},{"key":"957_CR2","unstructured":"Babaali P (2007) Generic and structural properties of random automata. PhD thesis, Stevens Institute of Technology"},{"key":"957_CR3","series-title":"LNCS","first-page":"80","volume-title":"Proceedings of the 7th international conference on languages and automata theory and applications 2013","author":"P Babaali","year":"2013","unstructured":"Babaali P, Knaplund C (2013) On the construction of a family of automata that are generically non-minimal. In: Proceedings of the 7th international conference on languages and automata theory and applications 2013. LNCS, pp 80\u201391"},{"key":"957_CR4","series-title":"Discrete mathematics and theoretical computer science proceedings","first-page":"151","volume-title":"International colloquium on mathematics and computer science 2006","author":"F Bassino","year":"2006","unstructured":"Bassino F, Nicaud C (2006) Accessible and deterministic automata: enumeration and Boltzmann samplers. In: International colloquium on mathematics and computer science 2006. Discrete mathematics and theoretical computer science proceedings, vol AG, pp 151\u2013160"},{"issue":"1\u20133","key":"957_CR5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2007.04.001","volume":"381","author":"F Bassino","year":"2007","unstructured":"Bassino F, Nicaud C (2007) Enumeration and random generation of accessible automata. Theor Comput Sci 381(1\u20133):86\u2013104","journal-title":"Theor Comput Sci"},{"key":"957_CR6","doi-asserted-by":"crossref","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 (2005) Random generation of DFAs. Theor Comput Sci 330:221\u2013235","journal-title":"Theor Comput Sci"},{"issue":"4","key":"957_CR7","first-page":"469","volume":"7","author":"M Domaratzki","year":"2002","unstructured":"Domaratzki M, Kisman D, Shallit J (2002) On the number of distinct languages accepted by finite automata with n states. J Autom Lang Comb 7(4):469\u2013486","journal-title":"J Autom Lang Comb"},{"key":"957_CR8","doi-asserted-by":"crossref","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 (1994) A calculus for the random generation of labelled combinatorial structures. Theor Comput Sci 132:1\u201335","journal-title":"Theor Comput Sci"},{"key":"957_CR9","volume-title":"Graphical enumeration","author":"F Harary","year":"1973","unstructured":"Harary F, Palmer EM (1973) Graphical enumeration. Academic Press, New York"},{"key":"957_CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/SWCT.1964.1","volume-title":"Proceedings of the fifth annual symposium on switching circuit theory and logical design","author":"MA Harrison","year":"1964","unstructured":"Harrison MA (1964) A census of finite automata. In: Proceedings of the fifth annual symposium on switching circuit theory and logical design, pp 44\u201346"},{"key":"957_CR11","first-page":"459","volume":"22","author":"AD Korshunov","year":"1986","unstructured":"Korshunov AD (1986) On the number of non-isomorphic strongly connected finite automata. J Inf Process Cybern 22:459\u2013462","journal-title":"J Inf Process Cybern"},{"issue":"1\u20134","key":"957_CR12","first-page":"123","volume":"115","author":"E M\u00e4kinen","year":"1999","unstructured":"M\u00e4kinen E (1999) Generating random binary trees, a survey. Inf Sci, Int J 115(1\u20134):123\u2013136","journal-title":"Inf Sci, Int J"},{"key":"957_CR13","unstructured":"Nicaud C (2000) \u00c9tude du compartement en moyenne des automates finis et des langages rationnels. PhD thesis, University Paris 7"},{"key":"957_CR14","volume-title":"Combinatorial algorithms: for computers and calculators","author":"A Nijenhuis","year":"1978","unstructured":"Nijenhuis A, Wilf HS (1978) Combinatorial algorithms: for computers and calculators. Academic Press, San Diego"},{"key":"957_CR15","volume-title":"Counting strongly connected finite automata","author":"RW Robinson","year":"1985","unstructured":"Robinson RW (1985) Counting strongly connected finite automata. Wiley, New York"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0957-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-0957-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-0957-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:10Z","timestamp":1559384650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-0957-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["957"],"URL":"https:\/\/doi.org\/10.1007\/s11227-013-0957-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,4]]}}}