Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Research Publications


Publications for Dominik Freydenberger

From (year): To (year):

Download all publications as Word document


Journal Articles

Thompson, S and Freydenberger, D (2024) Languages generated by conjunctive query fragments of FC[REG], Theory of Computing Systems, ISSN: 1432-4350. DOI: 10.1007/s00224-024-10198-4.

Freydenberger, DD and Schmid, ML (2019) Deterministic regular expressions with back-references, Journal of Computer and System Sciences, ISSN: 0022-0000. DOI: 10.1016/j.jcss.2019.04.001.

Freydenberger, D (2018) A logic for document spanners, Theory of Computing Systems, 63(7), pp.1679-1754, ISSN: 1432-4350. DOI: 10.1007/s00224-018-9874-1.

Freydenberger, D and Holldack, M (2017) Document spanners: from expressive power to decision problems, Theory of Computing Systems, 62(4), pp.854-898, ISSN: 1432-4350. DOI: 10.1007/s00224-017-9770-0.

Freydenberger, D and Kotzing, T (2014) Fast learning of restricted regular expressions and DTDs, Theory of Computing Systems, 57(4), pp.1114-1158, ISSN: 1432-4350. DOI: 10.1007/s00224-014-9559-3.

Freydenberger, D and Reidenbach, D (2013) Inferring descriptive generalisations of formal languages, ISSN: 0022-0000. DOI: 10.1016/j.jcss.2012.10.001.

Freydenberger, D (2013) Extended regular expressions: succinctness and decidability, Theory of Computing Systems, 53(2), pp.159-193, ISSN: 1432-4350. DOI: 10.1007/s00224-012-9389-0.

Freydenberger, D and Schweikardt, N (2013) Expressiveness and static analysis of extended conjunctive regular path queries, Journal of Computer and System Sciences, 79(6), pp.892-909, ISSN: 0022-0000. DOI: 10.1016/j.jcss.2013.01.008.

Freydenberger, D, Nevisi, H, Reidenbach, D (2012) Weakly unambiguous morphisms, ISSN: 0304-3975. DOI: 10.1016/j.tcs.2012.04.045.

Bremer, J and Freydenberger, D (2012) Inclusion problems for patterns with a bounded number of variables, Information and Computation, 220-221, pp.15-43, ISSN: 0890-5401. DOI: 10.1016/j.ic.2012.10.003.

Freydenberger, DD and Reidenbach, D (2010) Existence and nonexistence of descriptive patterns, Theoretical Computer Science, 411(34-36), pp.3274-3286, ISSN: 0304-3975.

Freydenberger, DD and Reidenbach, D (2010) Bad news on decision problems for patterns, Information and Computation, 208(1), pp.83-96, ISSN: 0890-5401.

Freydenberger, D and Reidenbach, D (2010) Existence and nonexistence of descriptive patterns, ISSN: 0304-3975. DOI: 10.1016/j.tcs.2010.05.033.

Freydenberger, D and Reidenbach, D (2010) Bad news on decision problems for patterns, ISSN: 0890-5401. DOI: 10.1016/j.ic.2009.04.002.

Freydenberger, DD and Reidenbach, D (2009) The unambiguity of segmented morphisms, Discrete Applied Mathematics, 157(14), pp.3055-3068.

Freydenberger, D and Reidenbach, D (2009) The unambiguity of segmented morphisms, ISSN: 0166-218X. DOI: 10.1016/j.dam.2009.06.009.

Freydenberger, DD, Reidenbach, D, Schneider, JC (2006) Unambiguous morphic images of strings, International Journal of Foundations of Computer Science, 17(3), pp.601-628, ISSN: 0129-0541. DOI: 10.1142/S0129054106004017.

Freydenberger, D, Reidenbach, D, Schneider, JC (2006) Unambiguous morphic images of strings, ISSN: 0129-0541.



Conferences

Thompson, S and Freydenberger, D (2024) Generalized core spanner inexpressibility via Ehrenfeucht-Fraïssé games for FC. In Agrawal, D (ed) Symposium on Principles of Database Systems 2024; Proceedings of the ACM on Management of Data, Santiago, Chile. DOI: 10.1145/3651143.

Thompson, S and Freydenberger, D (2023) Languages generated by conjunctive query fragments of FC[REG]. In Drewes, F and Volkov, M (ed) Developments in Language Theory 2023; Developments in Language Theory: DLT 2023, Umeå, Sweden, pp.233-245, ISBN: 9783031332630. DOI: 10.1007/978-3-031-33264-7_19.

Freydenberger, D and Thompson, S (2022) Splitting spanner atoms: A tool for acyclic core spanners. In Olteanu, D and Vortmeier, N (ed) 25th International Conference on Database Theory (ICDT 2022).; 25th International Conference on Database Theory (ICDT 2022), Virtual Conference, pp.1-10, ISBN: 9783959772235. DOI: 10.4230/LIPIcs.ICDT.2022.10.

Freydenberger, D and Peterfreund, L (2021) The theory of concatenation over finite models. In Bansal, N, Merelli, E, Worrell, J (ed) 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021); Leibniz International Proceedings in Informatics, Glasgow, Scotland (Virtual Conference). DOI: 10.4230/LIPIcs.ICALP.2021.130.

Freydenberger, D and Thompson, S (2020) Dynamic complexity of document spanners. In Jung, CLJC (ed) 23rd International Conference on Database Theory (ICDT 2020); 23rd International Conference on Database Theory (ICDT 2020), Copenhagen, Denmark, pp.1-11, ISBN: 9783959771399. DOI: 10.4230/LIPIcs.ICDT.2020.11.

Peterfreund, L, Kimelfeld, B, Freydenberger, D, Kroll, M (2019) Complexity bounds for relational algebra over document spanners. In ACM Symposium on Principles of Database Systems (PODS), Amsterdam,ISBN: 9781450362276. DOI: 10.1145/3294052.3319699.

Freydenberger, D, Kimelfeld, B, Peterfreund, L (2018) Joining extractions of regular expressions. In Symposium on Principles of Database Systems, Houston, Texas,ISBN: 9781450347068. DOI: 10.1145/3196959.3196967.

Freydenberger, D (2017) A logic for document spanners. In International Conference on Database Theory, Venice, Italy,ISBN: 9783959770248. DOI: 10.4230/LIPIcs.ICDT.2017.13.

Freydenberger, D and Schmid, ML (2017) Deterministic regular expressions with back-references. In 34th International Symposium on Theoretical Aspects of Computer Science, Hanover, Germany. DOI: 10.4230/LIPIcs.STACS.2017.33.

Freydenberger, D and Holldack, M (2016) Document spanners: from expressive power to decision problems. In Leibniz International Proceedings in Informatics, LIPIcs,, ISBN: 9783959770026. DOI: 10.4230/LIPIcs.ICDT.2016.17.

Freydenberger, D and Kotzing, T (2013) Fast learning of restricted regular expressions and DTDs. In ACM International Conference Proceeding Series, pp.45-56, ISBN: 9781450315982. DOI: 10.1145/2448496.2448504.

Freydenberger, D, Nevisi, H, Reidenbach, D (2011) Weakly unambiguous morphisms. In ,ISBN: 9783939897255. DOI: 10.4230/LIPIcs.STACS.2011.i.

Freydenberger, D (2011) Extended regular expressions: succinctness and decidability. In Leibniz International Proceedings in Informatics, LIPIcs, pp.507-518, ISBN: 9783939897255. DOI: 10.4230/LIPIcs.STACS.2011.507.

Freydenberger, D and Schweikardt, N (2011) Expressiveness and static analysis of extended conjunctive regular path queries. In CEUR Workshop Proceedings,.

Freydenberger, DD, Nevisi, H, Reidenbach, D (2011) Weakly Unambiguous Morphisms. In , 28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), pp.213-224, DOI: 10.4230/LIPIcs.STACS.2011.213.

Freydenberger, D and Reidenbach, D (2010) Inferring descriptive generalisations of formal languages. In ,ISBN: 9780982252925.

Bremer, J and Freydenberger, D (2010) Inclusion problems for patterns with a bounded number of variables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp.100-111, ISBN: 9783642144554. DOI: 10.1007/978-3-642-14455-4_11.

Freydenberger, D and Reidenbach, D (2009) Existence and nonexistence of descriptive patterns. In ,ISBN: 9783642027369. DOI: 10.1007/978-3-642-02737-6.

Freydenberger, D and Reidenbach, D (2008) Bad news on decision problems for patterns. In ,ISBN: 9783540857792. DOI: 10.1007/978-3-540-85780-8.

Freydenberger, D and Reidenbach, D (2007) The unambiguity of segmented morphisms. In ,ISBN: 9783540732075.

Freydenberger, D, Reidenbach, D, Schneider, JC (2005) Unambiguous morphic images of strings. In .



Reports

Freydenberger, DD and Peterfreund, L (2021) The theory of concatenation over finite models. DOI: 10.4230/LIPIcs.ICALP.2021.130.



Getting in touch

Research Office
Loughborough University
Loughborough
Leicestershire
LE11 3TU
researchpolicy@lboro.ac.uk
+44 (0)1509 222453