{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:07:29Z","timestamp":1742929649177,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_9","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"80-91","source":"Crossref","is-referenced-by-count":1,"title":["On the Construction of a Family of Automata That Are Generically Non-minimal"],"prefix":"10.1007","author":[{"given":"Parisa","family":"Babaali","sequence":"first","affiliation":[]},{"given":"Christopher","family":"Knaplund","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_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. Theoretical Computer Science\u00a0387(2), 93\u2013102 (2007)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","unstructured":"Babaali, P.: Generating random automata. In: Proceedings of the 2009 International Conference on Scientific Computing, pp. 85\u201389 (2009)"},{"key":"9_CR3","unstructured":"Babaali, P., Carta-Geradino, E., Knaplund, C.: The number of DFAs produced by a given spanning tree. In: Proceedings of the 2011 International Conference on Scientific Computing, pp. 212\u2013217 (2011)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Babaali, P., Knaplund, C.: On the construction of a family of automata that are generically minimal (2012) (preprint)","DOI":"10.1007\/978-3-642-37064-9_9"},{"issue":"1-3","key":"9_CR5","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. Theoretical Computer Science\u00a0381(1-3), 86\u2013104 (2007)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","unstructured":"Bassino, F., David, J., Sportiello, A.: Asymptotic enumeration of minimal automata. In: STACS, pp. 88\u201399 (2012)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bassino, F., Nicaud, C.: 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.\u00a0AG, pp. 151\u2013160 (2006)","DOI":"10.46298\/dmtcs.3499"},{"key":"9_CR8","first-page":"529","volume-title":"Proc. Sympos. Math. Theory of Automata (New York, 1962)","author":"J.A. Brzozowski","year":"1963","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proc. Sympos. Math. Theory of Automata (New York, 1962), pp. 529\u2013561. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn (1963)"},{"key":"9_CR9","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. Theoretical Computer Science\u00a0330, 221\u2013235 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9_CR10","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":"9_CR11","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. Theoretical Computer Science\u00a0132, 1\u201335 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","volume-title":"Graphical enumeration","author":"F. Harary","year":"1973","unstructured":"Harary, F., Palmer, E.M.: Graphical enumeration. Academic Press, New York (1973)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Harrison, M.A.: A census of finite automata. In: Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, pp. 44\u201346 (1964)","DOI":"10.1109\/SWCT.1964.1"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.: An n\n                           log\n                           n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computation (Proc. Internat. Sympos. Technion, Haifa), pp. 189\u2013196 (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"9_CR15","first-page":"459","volume":"22","author":"A.D. Korshunov","year":"1986","unstructured":"Korshunov, A.D.: On the number of non-isomorphic strongly connected finite automata. J. Inf. Process. Cybern.\u00a022, 459\u2013462 (1986)","journal-title":"J. Inf. Process. Cybern."},{"issue":"1-4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0020-0255(98)10080-4","volume":"115","author":"E. M\u00e4kinen","year":"1999","unstructured":"M\u00e4kinen, E.: Generating random binary trees - a survey. Information Sciences: an International Journal\u00a0115(1-4), 123\u2013136 (1999)","journal-title":"Information Sciences: an International Journal"},{"key":"9_CR17","first-page":"129","volume":"34","author":"E.F. Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken experiments on sequential machines. Automata Studies, Annals of Mathematical Studies\u00a034, 129\u2013153 (1956)","journal-title":"Automata Studies, Annals of Mathematical Studies"},{"key":"9_CR18","unstructured":"Nicaud, C.: \u00c9tude du compartement en moyenne des automates finis et des langages rationnels. PhD Thesis. University Paris 7 (2000)"},{"key":"9_CR19","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms: For Computers and Calculators. Academic Press (1978)"},{"key":"9_CR20","volume-title":"Counting strongly connected finite automata","author":"R.W. Robinson","year":"1985","unstructured":"Robinson, R.W.: Counting strongly connected finite automata. John Wiley & Sons, Inc., New York (1985)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T11:20:58Z","timestamp":1676632858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}