Dominik D. Freydenberger

According to our database, Dominik D. Freydenberger authored at least 24 papers between 2006 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraïssé Games for FC.

Sam M. Thompson, Dominik D. Freydenberger

CoRR, 2023

Languages Generated by Conjunctive Query Fragments of FC[REG].

Sam M. Thompson, Dominik D. Freydenberger

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022

Splitting Spanner Atoms: A Tool for Acyclic Core Spanners.

Dominik D. Freydenberger, Sam M. Thompson

Proceedings of the 25th International Conference on Database Theory, 2022

2021

The Theory of Concatenation over Finite Models.

Dominik D. Freydenberger, Liat Peterfreund

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Dynamic Complexity of Document Spanners.

Dominik D. Freydenberger, Sam M. Thompson

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

A Logic for Document Spanners.

Dominik D. Freydenberger

Theory Comput. Syst., 2019

Deterministic regular expressions with back-references.

Dominik D. Freydenberger, Markus L. Schmid

J. Comput. Syst. Sci., 2019

Finite models and the theory of concatenation.

Dominik D. Freydenberger, Liat Peterfreund

CoRR, 2019

Complexity Bounds for Relational Algebra over Document Spanners.

Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, Markus Kröll

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018

Document Spanners: From Expressive Power to Decision Problems.

Dominik D. Freydenberger, Mario Holldack

Theory Comput. Syst., 2018

Joining Extractions of Regular Expressions.

Dominik D. Freydenberger, Benny Kimelfeld, Liat Peterfreund

Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2015

Fast Learning of Restricted Regular Expressions and DTDs.

Dominik D. Freydenberger, Timo Kötzing

Theory Comput. Syst., 2015

Testing k-binomial equivalence.

Dominik D. Freydenberger, Pawel Gawrychowski, Juhani Karhumäki, Florin Manea, Wojciech Rytter

CoRR, 2015

2013

Extended Regular Expressions: Succinctness and Decidability.

Dominik D. Freydenberger

Theory Comput. Syst., 2013

Expressiveness and static analysis of extended conjunctive regular path queries.

Dominik D. Freydenberger, Nicole Schweikardt

J. Comput. Syst. Sci., 2013

Inferring descriptive generalisations of formal languages.

Dominik D. Freydenberger, Daniel Reidenbach

J. Comput. Syst. Sci., 2013

2012

Weakly unambiguous morphisms.

Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach

Theor. Comput. Sci., 2012

Inclusion problems for patterns with a bounded number of variables.

Joachim Bremer, Dominik D. Freydenberger

Inf. Comput., 2012

2011

Inclusion of pattern languages and related problems.

Dominik D. Freydenberger

PhD thesis, 2011

Inclusion of Pattern Languages and Related Problems.

Dominik D. Freydenberger

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010

Existence and nonexistence of descriptive patterns.

Dominik D. Freydenberger, Daniel Reidenbach

Theor. Comput. Sci., 2010

Bad news on decision problems for patterns.

Dominik D. Freydenberger, Daniel Reidenbach

Inf. Comput., 2010

2009

The unambiguity of segmented morphisms.

Dominik D. Freydenberger, Daniel Reidenbach

Discret. Appl. Math., 2009

2006

Unambiguous Morphic Images of Strings.

Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider

Int. J. Found. Comput. Sci., 2006