#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2005

2017

- This year (3)
- Last 5 years (6)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We study the expressiveness and the complexity of static analysis of extended conjunctive regular path queries (ECRPQs), introduced by Barceló et al. (PODS ’10). ECRPQs are an extension of conjunctive regular path queries (CRPQs), a well-studied language for querying graph structured databases. Our first main result shows that query containment and… (More)

- Dominik D. Freydenberger, Daniel Reidenbach
- Inf. Comput.
- 2008

We study the inclusion problem for pattern languages, which is shown to be undecidable by Jiang et al. (J. Comput. System Sci. 50, 1995). More precisely, Jiang et al. demonstrate that there is no effective procedure deciding the inclusion for the class of all pattern languages over all alphabets. Most applications of pattern languages, however, consider… (More)

- Dominik D. Freydenberger, Timo Kötzing
- Theory of Computing Systems
- 2013

We study the problem of generalizing from a finite sample to a language taken from a predefined language class. The two language classes we consider are subsets of the regular languages and have significance in the specification of XML documents (the classes corresponding to so called <i>chain regular expressions</i>, Chares, and to <i>single occurrence… (More)

- Dominik D. Freydenberger
- Theory of Computing Systems
- 2011

Most modern implementations of regular expression engines allow the use of variables (also called backreferences). The resulting extended regular expressions (which, in the literature, are also called practical regular expressions, rewbr, or regex) are able to express non-regular languages. The present paper demonstrates that extended regular-expressions… (More)

A nonerasing morphism σ is said to be weakly unambiguous with respect to a word s if σ is the only nonerasing morphism that can map s to σ(s), i. e., there does not exist any other nonerasing morphism τ satisfying τ(s) = σ(s). In the present paper, we wish to characterise those words with respect to which there exists such a morphism. This question is… (More)

- Dominik D. Freydenberger
- ICDT
- 2017

Document spanners are a formal framework for information extraction that was introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (PODS 2013, JACM 2015). One of the central models in this framework are core spanners, which are based on regular expressions with variables that are then extended with an algebra. As shown by Freydenberger and Holldack (ICDT… (More)

- Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider
- Int. J. Found. Comput. Sci.
- 2005

The task Task: Map a finite string α over an infinite alphabet onto a finite word w over a binary alphabet such that w reflects the structure of α "optimally".

- Dominik D. Freydenberger, Mario Holldack
- Theory of Computing Systems
- 2016

We examine document spanners, a formal framework for information extraction that was introduced by Fagin, Kimelfeld, Reiss, and Vansummeren (PODS 2013, JACM 2015). A document spanner is a function that maps an input string to a relation over spans (intervals of positions of the string). We focus on document spanners that are defined by regex formulas, which… (More)

- Dominik D. Freydenberger, Daniel Reidenbach
- Developments in Language Theory
- 2007

- Dominik D. Freydenberger, Daniel Reidenbach
- Theor. Comput. Sci.
- 2009