Unambiguous Morphic Images of Strings. - Dominik D. Freydenberger; Daniel Reidenbach; Johannes C. Schneider (Developments in Language Theory, 2005)

The Unambiguity of Segmented Morphisms. - Dominik D. Freydenberger; Daniel Reidenbach (Developments in Language Theory, 2007)

Bad News on Decision Problems for Patterns. - Dominik D. Freydenberger; Daniel Reidenbach (Developments in Language Theory, 2008)

Existence and Nonexistence of Descriptive Patterns. - Dominik D. Freydenberger; Daniel Reidenbach (Developments in Language Theory, 2009)

Inferring Descriptive Generalisations of Formal Languages. - Dominik D. Freydenberger; Daniel Reidenbach (COLT, 2010)

Inclusion Problems for Patterns with a Bounded Number of Variables. - Joachim Bremer; Dominik D. Freydenberger (Developments in Language Theory, 2010)

Expressiveness and Static Analysis of Extended Conjunctive Regular Path Queries. - Dominik D. Freydenberger; Nicole Schweikardt (AMW, 2011)

Inclusion of Pattern Languages and Related Problems. - Dominik D. Freydenberger (Ausgezeichnete Informatikdissertationen, 2011)

Extended Regular Expressions: Succinctness and Decidability. - Dominik D. Freydenberger (STACS, 2011)

Weakly Unambiguous Morphisms. - Dominik D. Freydenberger; Hossein Nevisi; Daniel Reidenbach (STACS, 2011)

Inclusion of pattern languages and related problems. - Dominik D. Freydenberger (Logos, 2011)

Fast learning of restricted regular expressions and DTDs. - Dominik D. Freydenberger; Timo Kötzing (ICDT, 2013)

Testing k-binomial equivalence. - Dominik D. Freydenberger; Pawel Gawrychowski; Juhani Karhumäki; Florin Manea; Wojciech Rytter (CoRR, 2015)

Document Spanners: From Expressive Power to Decision Problems. - Dominik D. Freydenberger; Mario Holldack (ICDT, 2016)

A Logic for Document Spanners. - Dominik D. Freydenberger (ICDT, 2017)

Deterministic Regular Expressions with Back-References. - Dominik D. Freydenberger; Markus L. Schmid (STACS, 2017)

Joining Extractions of Regular Expressions. - Dominik D. Freydenberger; Benny Kimelfeld; Liat Peterfreund (PODS, 2018)

Complexity Bounds for Relational Algebra over Document Spanners. - Liat Peterfreund; Dominik D. Freydenberger; Benny Kimelfeld; Markus Kröll (PODS, 2019)

Finite models and the theory of concatenation. - Dominik D. Freydenberger; Liat Peterfreund (CoRR, 2019)

Dynamic Complexity of Document Spanners. - Dominik D. Freydenberger; Sam M. Thompson (ICDT, 2020)

The Theory of Concatenation over Finite Models. - Dominik D. Freydenberger; Liat Peterfreund (ICALP, 2021)

Splitting Spanner Atoms: A Tool for Acyclic Core Spanners. - Dominik D. Freydenberger; Sam M. Thompson (ICDT, 2022)

Languages Generated by Conjunctive Query Fragments of FC[REG]. - Sam M. Thompson; Dominik D. Freydenberger (DLT, 2023)

Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC. - Sam M. Thompson; Dominik D. Freydenberger (Proc. ACM Manag. Data, 2024)

FC-Datalog as a Framework for Efficient String Querying. - Owen M. Bell; Joel D. Day; Dominik D. Freydenberger (ICDT, 2025)

Characterization and Decidability of FC-Definable Regular Languages. - Sam M. Thompson; Nicole Schweikardt; Dominik D. Freydenberger (LICS, 2025)

Research Report: Parsing with the Logic FC. - Owen M. Bell; Sam M. Thompson; Dominik D. Freydenberger (SP (Workshops), 2025)