{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:49Z","timestamp":1750307269223,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-233599"],"award-info":[{"award-number":["FP7-ICT-233599"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1938551.1938559","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"30-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Generating, sampling and counting subclasses of regular tree languages"],"prefix":"10.1145","author":[{"given":"Timos","family":"Antonopoulos","sequence":"first","affiliation":[{"name":"Hasselt University and Transnational University of Limburg"}]},{"given":"Floris","family":"Geerts","sequence":"additional","affiliation":[{"name":"University of Edinburgh"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dortmund"}]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[{"name":"Hasselt University and Transnational University of Limburg"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00294-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.029"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564769"},{"key":"e_1_3_2_1_4_1","volume-title":"Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications, 19(2--3):1--16","author":"Bassino F.","year":"2008","unstructured":"F. Bassino , J. David , and C. Nicaud . Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications, 19(2--3):1--16 , 2008 . F. Bassino, J. David, and C. Nicaud. Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications, 19(2--3):1--16, 2008."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.04.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90023-U"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559922"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367609"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1735886.1735890"},{"key":"e_1_3_2_1_10_1","first-page":"998","volume-title":"International Conference on Very Large Data Bases (VLDB)","author":"Bex G. J.","year":"2007","unstructured":"G. J. Bex , F. Neven , and S. Vansummeren . Inferring XML Schema Definitions from XML data . In International Conference on Very Large Data Bases (VLDB) , pages 998 -- 1009 , 2007 . G. J. Bex, F. Neven, and S. Vansummeren. Inferring XML Schema Definitions from XML data. In International Conference on Very Large Data Bases (VLDB), pages 998--1009, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646385.689859"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2695"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567280"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559831"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90226-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807118"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00025-8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2621"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02979-0_15"},{"key":"e_1_3_2_1_22_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"2007","unstructured":"J. E. Hopcroft , R. Motwani , and J. D. Ullman . Introduction to Automata Theory, Languages, and Computation . Addison-Wesley , 3 edition, 2007 . J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 3 edition, 2007."},{"key":"e_1_3_2_1_23_1","first-page":"551","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Kannan S.","year":"1995","unstructured":"S. Kannan , Z. Sweedyk , and S. R. Mahaney . Counting and random generation of strings in regular languages . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 551 -- 557 , 1995 . S. Kannan, Z. Sweedyk, and S. R. Mahaney. Counting and random generation of strings in regular languages. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 551--557, 1995."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30500-2_2"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)90033-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324185.1324188"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080743457"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166076"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.10.021"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111627.1111631"},{"key":"e_1_3_2_1_31_1","volume-title":"Combinatorial algorithms","author":"Nijenhuis A.","year":"1979","unstructured":"A. Nijenhuis and H. Wilf . Combinatorial algorithms . Academic Press Inc ., 1979 . A. Nijenhuis and H. Wilf. Combinatorial algorithms. Academic Press Inc., 1979."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219027"}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","acronym":"EDBT\/ICDT '11","location":"Uppsala Sweden"},"container-title":["Proceedings of the 14th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:54Z","timestamp":1750243974000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":31,"alternative-id":["10.1145\/1938551.1938559","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938559","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}