{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:54Z","timestamp":1759637574807},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236786"},{"type":"electronic","value":"9783030236793"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-23679-3_15","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:02:38Z","timestamp":1562526158000},"page":"184-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o","family":"Pires","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"issue":"2","key":"15_CR1","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. Theoret. Comput. Sci. 155(2), 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"15_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.25596\/jalc-2017-005","volume":"22","author":"R Bastos","year":"2017","unstructured":"Bastos, R., Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average complexity of partial derivative automata for semi-extended expressions. J. Autom. Lang. Comb. 22(1\u20133), 5\u201328 (2017). \n                      https:\/\/doi.org\/10.25596\/jalc-2017-005","journal-title":"J. Autom. Lang. Comb."},{"issue":"7","key":"15_CR3","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1142\/S0129054111008908","volume":"22","author":"S Broda","year":"2011","unstructured":"Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average state complexity of partial derivative automata: an analytic combinatorics approach. Internat. J. Found. Comput. Sci. 22(7), 1593\u20131606 (2011)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J Brzozowski","year":"1964","unstructured":"Brzozowski, J.: Derivatives of regular expressions. J. ACM 11, 481\u2013494 (1964)","journal-title":"J. ACM"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179\u2013191. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-21254-3_13"},{"issue":"3","key":"15_CR6","first-page":"195","volume":"45","author":"JM Champarnaud","year":"2001","unstructured":"Champarnaud, J.M., Ziadi, D.: From Mirkin\u2019s prebases to Antimirov\u2019s word partial derivatives. Fund. Inform. 45(3), 195\u2013205 (2001)","journal-title":"Fund. Inform."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0304-3975(01)00267-5","volume":"289","author":"JM Champarnaud","year":"2002","unstructured":"Champarnaud, J.M., Ziadi, D.: Canonical derivatives, partial derivatives and finite automaton constructions. Theoret. Comput. Sci. 289, 137\u2013163 (2002). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(01)00267-5","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.7561\/SACS.2017.2.137","volume":"27","author":"A Demaille","year":"2017","unstructured":"Demaille, A.: Derived-term automata of multitape expressions with composition. Sci. Ann. Comput. Sci. 27(2), 137\u2013176 (2017). \n                      https:\/\/doi.org\/10.7561\/SACS.2017.2.137","journal-title":"Sci. Ann. Comput. Sci."},{"key":"15_CR9","unstructured":"FAdo: Tools for formal languages manipulation. \n                      http:\/\/fado.dcc.fc.up.pt\/\n                      \n                    . Accessed Mar 2019"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-319-94812-6_2","volume-title":"Implementation and Application of Automata","author":"Stavros Konstantinidis","year":"2018","unstructured":"Konstantinidis, S., Moreira, N., Reis, R., Young, J.: Regular expressions and transducers over alphabet-invariant and user-defined labels. CoRR abs\/1805.01829 (2018). \n                      http:\/\/arxiv.org\/abs\/1805.01829"},{"issue":"1\u20133","key":"15_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.10.016","volume":"332","author":"S Lombardy","year":"2005","unstructured":"Lombardy, S., Sakarovitch, J.: Derivatives of rational expressions with multiplicity. Theoret. Comput. Sci. 332(1\u20133), 141\u2013177 (2005). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2004.10.016","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","first-page":"51","volume":"5","author":"BG Mirkin","year":"1966","unstructured":"Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 51\u201357 (1966)","journal-title":"Eng. Cybern."},{"key":"15_CR13","unstructured":"Newton, J.: Representing and computing with types in dynamically typed languages. Ph.D. thesis, Sorbonne Universit\u00e9, Paris, France, November 2018"},{"key":"15_CR14","unstructured":"Pires, J.: Transducers and 2D regular expressions. Master\u2019s thesis, Departamento de Ci\u00eancia de Computadores, Faculdade de Ci\u00eancias da Universidade do Porto, Porto, Portugal (2018)"},{"key":"15_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Berlin (2009)"},{"key":"15_CR16","unstructured":"Sakarovitch, J.: Automata and rational expressions. CoRR abs\/1502.03573 (2015). \n                      http:\/\/arxiv.org\/abs\/1502.03573"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23679-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:11:42Z","timestamp":1562526702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23679-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236786","9783030236793"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23679-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/ciaa2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"17","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":"2","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":"61% - 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":"2.89","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":"2.625","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)"}}]}}