{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:08:12Z","timestamp":1743041292893,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_19","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"233-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Languages Generated by\u00a0Conjunctive Query Fragments of\u00a0FC[REG]"],"prefix":"10.1007","author":[{"given":"Sam M.","family":"Thompson","sequence":"first","affiliation":[]},{"given":"Dominik D.","family":"Freydenberger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"19_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21(1), 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR3","unstructured":"Day, J.D., Manea, F., Nowotka, D.: The hardness of solving simple word equations. In: Proceedings of MFCS 2017, pp. 18:1\u201318:14 (2017)"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.ic.2005.04.002","volume":"202","author":"V Diekert","year":"2005","unstructured":"Diekert, V., Gutierrez, C., Hagenah, C.: The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput. 202(2), 105\u2013140 (2005)","journal-title":"Inf. Comput."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Diekert, V., Robson, J.M.: Quadratic word equations. Jewels are Forever: Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 314\u2013326 (1999)","DOI":"10.1007\/978-3-642-60207-8_28"},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/BF02112533","volume":"36","author":"VG Durnev","year":"1995","unstructured":"Durnev, V.G.: Undecidability of the positive $$\\forall \\exists $$ 3-theory of a free semigroup. Siberian Math. J. 36(5), 917\u2013929 (1995)","journal-title":"Siberian Math. J."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2699442","volume":"62","author":"R Fagin","year":"2015","unstructured":"Fagin, R., Kimelfeld, B., Reiss, F., Vansummeren, S.: Document spanners: a formal approach to information extraction. J. ACM 62(2), 12 (2015)","journal-title":"J. ACM"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00224-012-9389-0","volume":"53","author":"DD Freydenberger","year":"2013","unstructured":"Freydenberger, D.D.: Extended regular expressions: succinctness and decidability. Theory Comput. Syst. 53(2), 159\u2013193 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"7","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1007\/s00224-018-9874-1","volume":"63","author":"DD Freydenberger","year":"2019","unstructured":"Freydenberger, D.D.: A logic for document spanners. Theory Comput. Syst. 63(7), 1679\u20131754 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1007\/s00224-017-9770-0","volume":"62","author":"DD Freydenberger","year":"2018","unstructured":"Freydenberger, D.D., Holldack, M.: Document spanners: from expressive power to decision problems. Theory Comput. Syst. 62(4), 854\u2013898 (2018)","journal-title":"Theory Comput. Syst."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Freydenberger, D.D., Peterfreund, L.: The theory of concatenation over finite models. In: Proceedings of ICALP 2021, pp. 130:1\u2013130:17 (2021)","DOI":"10.1111\/ijet.12288"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2019.04.001","volume":"105","author":"DD Freydenberger","year":"2019","unstructured":"Freydenberger, D.D., Schmid, M.L.: Deterministic regular expressions with back-references. J. Comput. Syst. Sci. 105, 1\u201339 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR13","unstructured":"Freydenberger, D.D., Thompson, S.M.: Splitting spanner atoms: a tool for acyclic core spanners. In: Proceedings of ICDT 2022, pp. 6:1\u20136:18 (2022)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Geilke, M., Zilles, S.: Polynomial-time algorithms for learning typed pattern languages. In: International Conference on Language and Automata Theory and Applications, pp. 277\u2013288 (2012)","DOI":"10.1007\/978-3-642-28332-1_24"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0304-3975(83)90016-6","volume":"26","author":"J Hartmanis","year":"1983","unstructured":"Hartmanis, J.: On G\u00f6del speed-up and succinctness of language representations. Theor. Comput. Sci. 26(3), 335\u2013342 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1145\/337244.337255","volume":"47","author":"J Karhum\u00e4ki","year":"2000","unstructured":"Karhum\u00e4ki, J., Mignosi, F., Plandowski, W.: The expressibility of languages and relations by word equations. J. ACM 47(3), 483\u2013505 (2000)","journal-title":"J. ACM"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Koshiba, T.: Typed pattern languages and their learnability. In: European Conference on Computational Learning Theory, pp. 367\u2013379 (1995)","DOI":"10.1007\/3-540-59119-2_192"},{"issue":"05","key":"19_CR18","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054105003406","volume":"16","author":"M Kutrib","year":"2005","unstructured":"Kutrib, M.: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16(05), 957\u2013973 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words, vol. 17. Cambridge University Press, Cambridge (1997)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, Volume 1: Word, Language, Grammar. Springer, Cham (1997)","DOI":"10.1007\/978-3-642-59136-5"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Schmid, M.L.: Inside the class of regex languages. In: Proceedings of DLT 2012, pp. 73\u201384 (2012)","DOI":"10.1007\/978-3-642-31653-1_8"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2016.02.003","volume":"249","author":"ML Schmid","year":"2016","unstructured":"Schmid, M.L.: Characterising REGEX languages by regular languages equipped with factor-referencing. Inf. Comput. 249, 1\u201317 (2016)","journal-title":"Inf. Comput."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: RIMS Symposia on Software Science and Engineering, pp. 115\u2013127 (1983)","DOI":"10.1007\/3-540-11980-9_19"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T16:18:26Z","timestamp":1729441106000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Due to the theoretical nature of the research presented in this paper, no data was captured, generated, or analysed for this work.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data Availability"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","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":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","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":"32","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":"19","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":"0","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":"59% - 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":"4- Invited papers and 32 submissions (31 regular ones and one invited)","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)"}}]}}