FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W806489719> ?p ?o ?g. }

• W806489719 abstract "In this thesis, we investigate the complexity of the membership problem for pattern languages. A pattern is a string over the union of the alphabets A and X, where X := {x_1, x_2, x_3, ...} is a countable set of variables and A is a finite alphabet containing terminals (e.g., A := {a, b, c, d}). Every pattern, e.g., p := x_1 x_2 a b x_2 b x_1 c x_2, describes a pattern language, i.e., the set of all words that can be obtained by uniformly substituting the variables in the pattern by arbitrary strings over A. Hence, u := cacaaabaabcaccaa is a word of the pattern language of p, since substituting cac for x_1 and aa for x_2 yields u. On the other hand, there is no way to obtain the word u' := bbbababbacaaba by substituting the occurrences of x_1 and x_2 in p by words over A.The problem to decide for a given pattern q and a given word w whether or not w is in the pattern language of q is called the membership problem for pattern languages. Consequently, (p, u) is a positive instance and (p, u') is a negative instance of the membership problem for pattern languages. For the unrestricted case, i.e., for arbitrary patterns and words, the membership problem is NP-complete. In this thesis, we identify classes of patterns for which the membership problem can be solved efficiently.Our first main result in this regard is that the variable distance, i.e., the maximum number of different variables that separate two consecutive occurrences of the same variable, substantially contributes to the complexity of the membership problem for pattern languages. More precisely, for every class of patterns with a bounded variable distance the membership problem can be solved efficiently. The second main result is that the same holds for every class of patterns with a bounded scope coincidence degree, where the scope coincidence degree is the maximum number of intervals that cover a common position in the pattern, where each interval is given by the leftmost and rightmost occurrence of a variable in the pattern.The proof of our first main result is based on automata theory. More precisely, we introduce a new automata model that is used as an algorithmic framework in order to show that the membership problem for pattern languages can be solved in time that is exponential only in the variable distance of the corresponding pattern. We then take a closer look at this automata model and subject it to a sound theoretical analysis. The second main result is obtained in a completely different way. We encode patterns and words as relational structures and we then reduce the membership problem for pattern languages to the homomorphism problem of relational structures, which allows us to exploit the concept of the treewidth. This approach turns out be successful, and we show that it has potential to identify further classes of patterns with a polynomial time membership problem.Furthermore, we take a closer look at two aspects of pattern languages that are indirectly related to the membership problem. Firstly, we investigate the phenomenon that patterns can describe regular or context-free languages in an unexpected way, which implies that their membership problem can be solved efficiently. In this regard, we present several sufficient conditions and necessary conditions for the regularity and context-freeness of pattern languages. Secondly, we compare pattern languages with languages given by so-called extended regular expressions with backreferences (REGEX). The membership problem for REGEX languages is very important in practice and since REGEX are similar to pattern languages, it might be possible to improve algorithms for the membership problem for REGEX languages by investigating their relationship to patterns. In this regard, we investigate how patterns can be extended in order to describe large classes of REGEX languages." @default.
• W806489719 created "2016-06-24" @default.
• W806489719 creator A5038601790 @default.
• W806489719 date "2012-01-01" @default.
• W806489719 modified "2023-09-24" @default.
• W806489719 title "On the membership problem for pattern languages and related topics" @default.
• W806489719 cites W134387435 @default.
• W806489719 cites W141970373 @default.
• W806489719 cites W1488422606 @default.
• W806489719 cites W1503180825 @default.
• W806489719 cites W1535681052 @default.
• W806489719 cites W1548540712 @default.
• W806489719 cites W1548607128 @default.
• W806489719 cites W1570425181 @default.
• W806489719 cites W1570445666 @default.
• W806489719 cites W1580470579 @default.
• W806489719 cites W1595764749 @default.
• W806489719 cites W1601674470 @default.
• W806489719 cites W1686574681 @default.
• W806489719 cites W1809937850 @default.
• W806489719 cites W1816620374 @default.
• W806489719 cites W1884033210 @default.
• W806489719 cites W191408160 @default.
• W806489719 cites W191758795 @default.
• W806489719 cites W1926042614 @default.
• W806489719 cites W1964169783 @default.
• W806489719 cites W1965415591 @default.
• W806489719 cites W1970263043 @default.
• W806489719 cites W1975698236 @default.
• W806489719 cites W1976643993 @default.
• W806489719 cites W1985604029 @default.
• W806489719 cites W1989382950 @default.
• W806489719 cites W1989657066 @default.
• W806489719 cites W1990129203 @default.
• W806489719 cites W199026491 @default.
• W806489719 cites W1994584977 @default.
• W806489719 cites W1997713618 @default.
• W806489719 cites W2002089154 @default.
• W806489719 cites W2005830269 @default.
• W806489719 cites W2006253309 @default.
• W806489719 cites W2010856808 @default.
• W806489719 cites W2010930012 @default.
• W806489719 cites W2012346719 @default.
• W806489719 cites W2019817895 @default.
• W806489719 cites W2020039713 @default.
• W806489719 cites W2023999667 @default.
• W806489719 cites W2032744775 @default.
• W806489719 cites W2035166717 @default.
• W806489719 cites W2035842346 @default.
• W806489719 cites W2036980610 @default.
• W806489719 cites W2040176884 @default.
• W806489719 cites W2040880412 @default.
• W806489719 cites W2049780512 @default.
• W806489719 cites W2051275734 @default.
• W806489719 cites W2054801208 @default.
• W806489719 cites W2057070067 @default.
• W806489719 cites W2061970672 @default.
• W806489719 cites W2064771942 @default.
• W806489719 cites W2067656180 @default.
• W806489719 cites W2067889072 @default.
• W806489719 cites W2072607050 @default.
• W806489719 cites W2077239229 @default.
• W806489719 cites W2080175276 @default.
• W806489719 cites W2080895803 @default.
• W806489719 cites W2082135431 @default.
• W806489719 cites W2083735143 @default.
• W806489719 cites W2088579057 @default.
• W806489719 cites W2090869915 @default.
• W806489719 cites W2100850484 @default.
• W806489719 cites W2111415409 @default.
• W806489719 cites W2125690314 @default.
• W806489719 cites W2159981363 @default.
• W806489719 cites W2166034077 @default.
• W806489719 cites W2166265158 @default.
• W806489719 cites W2395807140 @default.
• W806489719 cites W2911403062 @default.
• W806489719 cites W2913383557 @default.
• W806489719 cites W2913904462 @default.
• W806489719 cites W2914032487 @default.
• W806489719 cites W2983224876 @default.
• W806489719 cites W31397120 @default.
• W806489719 cites W3153226919 @default.
• W806489719 cites W58759770 @default.
• W806489719 cites W82547360 @default.
• W806489719 cites W99828349 @default.
• W806489719 hasPublicationYear "2012" @default.
• W806489719 type Work @default.
• W806489719 sameAs 806489719 @default.
• W806489719 citedByCount "0" @default.
• W806489719 crossrefType "dissertation" @default.
• W806489719 hasAuthorship W806489719A5038601790 @default.
• W806489719 hasConcept C110729354 @default.
• W806489719 hasConcept C112876837 @default.
• W806489719 hasConcept C114614502 @default.
• W806489719 hasConcept C118615104 @default.
• W806489719 hasConcept C138885662 @default.
• W806489719 hasConcept C157486923 @default.
• W806489719 hasConcept C177264268 @default.
• W806489719 hasConcept C199360897 @default.
• W806489719 hasConcept C2524010 @default.

• next