Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Wiedenhöft, Max"'
Autor:
Nowotka, Dirk, Wiedenhöft, Max
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. Regular constraints restrict valid substitutions of variables by a
Externí odkaz:
http://arxiv.org/abs/2411.07275
Autor:
Nowotka, Dirk, Wiedenhöft, Max
Patterns are words with terminals and variables. The language of a pattern is the set of words obtained by uniformly substituting all variables with words that contain only terminals. Length constraints restrict valid substitutions of variables by as
Externí odkaz:
http://arxiv.org/abs/2411.06904
A scattered factor of a word $w$ is a word $u$ that can be obtained by deleting arbitary letters from $w$ and keep the order of the remaining. Barker et al. introduced the notion of $k$-universality, calling a word $k$-universal, if it contains all p
Externí odkaz:
http://arxiv.org/abs/2407.18599
Autor:
Fleischmann, Pamela, Kim, Sungmin, Koß, Tore, Manea, Florin, Nowotka, Dirk, Siemer, Stefan, Wiedenhöft, Max
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computational complexity.
Externí odkaz:
http://arxiv.org/abs/2308.08374