Kolloquiumsvortrag Prof. Dr. Florin Manea (Göttingen)
We consider a series of natural problems related to the processing of textual data, rooted in areas as diverse as information extraction, bioinformatics, algorithmic learning theory, or formal verification, and see how they can all be formalized within the same framework. In this framework, we say that a pattern α (that is, a string of string-variables and letters from a fixed alphabet Σ) matches another pattern β if a text T, over Σ, can be obtained both from α and β by uniformly replacing the variables of the two patterns by words over Σ. In the case when β contains no variables, i.e., β=T is a text, a match occurs if β can be obtained from α by uniformly replacing the variables of α by words over Σ. The respective matching problem, i. e., deciding whether two given patterns match, is computationally hard, but efficient algorithms exist for classes of patterns with restricted structure. In this talk, we overview a series of recent results in this area.
Zeit & Ort
21.01.2022 | 14:00 c.t.