{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:23:13Z","timestamp":1743142993960,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031001222"},{"type":"electronic","value":"9783031001239"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00123-9_41","type":"book-chapter","created":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:14:54Z","timestamp":1651007694000},"page":"526-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting"],"prefix":"10.1007","author":[{"given":"Xiaofan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,8]]},"reference":[{"issue":"8","key":"41_CR1","first-page":"748","volume":"42","author":"A Ade-Ibijola","year":"2020","unstructured":"Ade-Ibijola, A.: Synthesis of regular expression problems and solutions. Int. J. Comput. Appl. 42(8), 748\u2013764 (2020)","journal-title":"Int. J. Comput. Appl."},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-96562-8_3","volume-title":"Machine Learning for Dynamic Software Analysis: Potentials and Limits","author":"BK Aichernig","year":"2018","unstructured":"Aichernig, B.K., Mostowski, W., Mousavi, M.R., Tappler, M., Taromirad, M.: Model learning and model-based testing. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 74\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96562-8_3"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11872436_23","volume-title":"Grammatical Inference: Algorithms and Applications","author":"L Becerra-Bonache","year":"2006","unstructured":"Becerra-Bonache, L., Dediu, A.H., T\u00eern\u0103uc\u0103, C.: Learning DFA from correction and equivalence queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281\u2013292. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11872436_23"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.04.022","volume":"489","author":"M Berglund","year":"2013","unstructured":"Berglund, M., Bj\u00f6rklund, H., Bj\u00f6rklund, J.: Shuffled languages representation and recognition. Theoret. Comput. Sci. 489, 1\u201320 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"41_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-21254-3_10","volume-title":"Language and Automata Theory and Applications","author":"M Berglund","year":"2011","unstructured":"Berglund, M., Bj\u00f6rklund, H., H\u00f6gberg, J.: Recognizing shuffled languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 142\u2013154. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_10"},{"key":"41_CR6","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: International Conference on Very Large Data Bases, Seoul, Korea, September, pp. 115\u2013126 (2006)"},{"issue":"2","key":"41_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1735886.1735890","volume":"35","author":"GJ Bex","year":"2010","unstructured":"Bex, G.J., Neven, F., Schwentick, T., Vansummeren, S.: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2), 1\u201347 (2010)","journal-title":"ACM Trans. Database Syst."},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ic.2015.11.005","volume":"246","author":"J Bj\u00f6rklund","year":"2016","unstructured":"Bj\u00f6rklund, J., Fernau, H., Kasprzik, A.: Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246, 3\u201319 (2016)","journal-title":"Inf. Comput."},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ic.2017.08.013","volume":"259","author":"S Broda","year":"2018","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: Automata for regular expressions with shuffle. Inf. Comput. 259, 162\u2013173 (2018)","journal-title":"Inf. Comput."},{"issue":"2","key":"41_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0304-3975(93)90287-4","volume":"120","author":"A Br\u00fcggemann-Klein","year":"1993","unstructured":"Br\u00fcggemann-Klein, A.: Regular expressions into finite automata. Theoret. Comput. Sci. 120(2), 197\u2013213 (1993)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"41_CR11","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182\u2013206 (1998)","journal-title":"Inf. Comput."},{"key":"41_CR12","unstructured":"Clark, J., Makoto, M.: Relax NG Tutorial. OASIS Committee Specification (2001). http:\/\/www.oasis-open.org\/committees\/relax-ng\/tutorial-20011203.html"},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3132701","volume":"42","author":"D Colazzo","year":"2017","unstructured":"Colazzo, D., Ghelli, G., Sartiani, C.: Linear time membership in a class of regular expressions with counting, interleaving, and unordered concatenation. ACM Trans. Database Syst. (TODS) 42(4), 24 (2017)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"2","key":"41_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"VK Garg","year":"1992","unstructured":"Garg, V.K., Ragunath, M.: Concurrent regular expressions and their relationship to petri nets. Theoret. Comput. Sci. 96(2), 285\u2013304 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"41_CR15","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/100814196","volume":"41","author":"W Gelade","year":"2012","unstructured":"Gelade, W., Gyssens, M., Martens, W.: Regular expressions with counting: weak versus strong determinism. SIAM J. Comput. 41(1), 160\u2013190 (2012)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"41_CR16","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1137\/070697367","volume":"38","author":"W Gelade","year":"2009","unstructured":"Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: numerical constraints and interleaving. SIAM J. Comput. 38(5), 2021\u20132043 (2009)","journal-title":"SIAM J. Comput."},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Ghelli, G., Colazzo, D., Sartiani, C.: Linear time membership in a class of regular expressions with interleaving and counting. In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 389\u2013398. ACM (2008)","DOI":"10.1145\/1458082.1458135"},{"issue":"3","key":"41_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/321281.321294","volume":"12","author":"S Ginsburg","year":"1965","unstructured":"Ginsburg, S., Spanier, E.H.: Mappings of languages by two-tape devices. J. ACM (JACM) 12(3), 423\u2013434 (1965)","journal-title":"J. ACM (JACM)"},{"key":"41_CR19","unstructured":"Harris, S., Seaborne, A.: SPARQL 1.1 query language. W3C Recommendation 21(10), 778 (2013)"},{"issue":"11","key":"41_CR20","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1002\/spe.4380181105","volume":"18","author":"A Hume","year":"1988","unstructured":"Hume, A.: A tale of two greps. Softw. Pract. Exp. 18(11), 1063\u20131072 (1988)","journal-title":"Softw. Pract. Exp."},{"issue":"1\u20132","key":"41_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(99)00109-7","volume":"250","author":"J Jedrzejowicz","year":"2001","unstructured":"Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. Theoret. Comput. Sci. 250(1\u20132), 31\u201353 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"41_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s41060-018-0107-0","volume":"6","author":"G Kougka","year":"2018","unstructured":"Kougka, G., Gounaris, A., Simitsis, A.: The many faces of data-centric workflow optimization: a survey. Int. J. Data Sci. Anal. 6(2), 81\u2013107 (2018). https:\/\/doi.org\/10.1007\/s41060-018-0107-0","journal-title":"Int. J. Data Sci. Anal."},{"issue":"2","key":"41_CR23","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2850413","volume":"63","author":"L Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graphs with data. J. ACM (JACM) 63(2), 14 (2016)","journal-title":"J. ACM (JACM)"},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"Lou, J.G., Fu, Q., Yang, S., Li, J., Wu, B.: Mining program workflow from interleaved traces. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 613\u2013622 (2010)","DOI":"10.1145\/1835804.1835883"},{"key":"41_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-63121-9_8","volume-title":"Models, Algorithms, Logics and Tools","author":"O Maler","year":"2017","unstructured":"Maler, O., Mens, I.-E.: A generic algorithm for learning symbolic automata from membership queries. In: Aceto, L., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 146\u2013169. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_8"},{"issue":"3","key":"41_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/3105960","volume":"42","author":"W Martens","year":"2017","unstructured":"Martens, W., Neven, F., Niewerth, M., Schwentick, T.: BonXai: combining the simplicity of DTD with the expressiveness of XML Schema. ACM Trans. Database Syst. (TODS) 42(3), 15 (2017)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"2","key":"41_CR27","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1006\/inco.1994.1098","volume":"115","author":"AJ Mayer","year":"1994","unstructured":"Mayer, A.J., Stockmeyer, L.J.: The complexity of word problems-this time with interleaving. Inf. Comput. 115(2), 293\u2013311 (1994)","journal-title":"Inf. Comput."},{"key":"41_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-030-25540-4_16","volume-title":"Computer Aided Verification","author":"M Garc\u00eda Soto","year":"2019","unstructured":"Garc\u00eda Soto, M., Henzinger, T.A., Schilling, C., Zeleznik, L.: Membership-based synthesis of linear hybrid automata. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 297\u2013314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_16"},{"issue":"1","key":"41_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0164-1212(94)90112-0","volume":"27","author":"PD Stotts","year":"1994","unstructured":"Stotts, P.D., Pugh, W.: Parallel finite automata for modeling concurrent software systems. J. Syst. Softw. 27(1), 27\u201343 (1994)","journal-title":"J. Syst. Softw."},{"key":"41_CR30","doi-asserted-by":"crossref","unstructured":"Tappler, M., Aichernig, B.K., Bloem, R.: Model-based testing IoT communication via active automata learning. In: 2017 IEEE International Conference on Software Testing, Verification and Validation (ICST), pp. 276\u2013287. IEEE (2017)","DOI":"10.1109\/ICST.2017.32"},{"key":"41_CR31","unstructured":"Thompson, H., Beech, D., Maloney, M., Mendelsohn, N.: W3C XML Schema Definition Language (XSD) 1.1 Part 1: Structures (2012)"},{"key":"41_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-030-75765-6_25","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X Wang","year":"2021","unstructured":"Wang, X.: Learning finite automata with shuffle. In: Karlapalem, K., et al. (eds.) PAKDD 2021. LNCS (LNAI), vol. 12713, pp. 308\u2013320. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75765-6_25"},{"key":"41_CR33","unstructured":"Wang, X.: Research on learning algorithms for extended regular expressions and their automata. Ph.D. thesis, University of Chinese Academy of Sciences (2021). (in Chinese)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00123-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,26]],"date-time":"2022-04-26T21:19:14Z","timestamp":1651007954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00123-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031001222","9783031001239"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00123-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2022.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"543","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was originally planned to take place in Hyberabad, India. 24 other papers are included in the volume.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}