咨询与建议

限定检索结果

文献类型

  • 3 篇 会议
  • 1 篇 期刊文献

馆藏范围

  • 4 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 4 篇 工学
    • 4 篇 计算机科学与技术...
  • 2 篇 理学
    • 2 篇 数学

主题

  • 4 篇 patterns with va...
  • 3 篇 combinatorial pa...
  • 2 篇 np-complete stri...
  • 2 篇 combinatorics on...
  • 1 篇 repetitions
  • 1 篇 matching
  • 1 篇 pseudo-repetitio...
  • 1 篇 string structura...
  • 1 篇 np-hardness
  • 1 篇 efficient algori...

机构

  • 1 篇 univ trier fachb...
  • 1 篇 univ kiel kiel
  • 1 篇 univ trier fachb...
  • 1 篇 gottingen univ i...
  • 1 篇 loughborough uni...
  • 1 篇 trier univ trier
  • 1 篇 univ trier fb 4 ...
  • 1 篇 rudower chaussee...
  • 1 篇 univ kiel dept c...
  • 1 篇 christian albrec...
  • 1 篇 ural fed univ in...

作者

  • 4 篇 manea florin
  • 3 篇 schmid markus l.
  • 2 篇 mercas robert
  • 2 篇 fernau henning
  • 1 篇 nowotka dirk
  • 1 篇 kosolobov dmitry

语言

  • 4 篇 英文
检索条件"主题词=patterns with variables"
4 条 记 录,以下是1-10 订阅
排序:
Matching patterns with variables  1
收藏 引用
12th International Conference on Combinatorics on Words (WORDS)
作者: Manea, Florin Schmid, Markus L. Univ Kiel Kiel Germany Trier Univ Trier Germany
A pattern alpha (i. e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of a by terminal words. The respective matching problem, i. e., deciding whether... 详细信息
来源: 评论
Pattern Matching with variables: Efficient Algorithms and Complexity Results
收藏 引用
ACM TRANSACTIONS ON COMPUTATION THEORY 2020年 第1期12卷 6-6页
作者: Fernau, Henning Manea, Florin Mercas, Robert Schmid, Markus L. Univ Trier Fachbereich 4 Abt Informat Wissensch Trier Germany Univ Trier FB 4 Abt Informat D-54286 Trier Germany Gottingen Univ Inst Comp Sci Goldschmidtstr 7 D-37077 Gottingen Germany Loughborough Univ Dept Comp Sci Haslegrave Bldg Loughborough LE11 3TU Leics England Rudower Chaussee 25 D-12489 Berlin Adlershof Germany
A pattern alpha (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of alpha by terminal words. The respective matching problem, i.e., deciding wheth... 详细信息
来源: 评论
Pattern Matching with variables: Fast Algorithms and New Hardness Results  32
Pattern Matching with Variables: Fast Algorithms and New Har...
收藏 引用
32nd International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Fernau, Henning Manea, Florin Mercas, Robert Schmid, Markus L. Univ Trier Fachbereich Abt Informat Wissensch 4 D-54286 Trier Germany Univ Kiel Dept Comp Sci D-24098 Kiel Germany
A pattern (i. e., a string of variables and terminals) maps to a word, if this is obtained by uniformly replacing the variables by terminal words;deciding this is NP-complete. We present efficient algorithms(1) that s... 详细信息
来源: 评论
Detecting One-Variable patterns  24th
Detecting One-Variable Patterns
收藏 引用
24th International Symposium on String Processing and Information Retrieval (SPIRE)
作者: Kosolobov, Dmitry Manea, Florin Nowotka, Dirk Christian Albrechts Univ Kiel Inst Informat Kiel Germany Ural Fed Univ Inst Math & Comp Sci Ekaterinburg Russia
Given a pattern p = s(1)x(1)s(2)x(2) center dot center dot center dot s(r-1)x(r-1)s(r) such that x(1), x(2),..., x(r-1) is an element of {x, (x) over left arrow>}, where (x) over left arrow is a variable and. x its... 详细信息
来源: 评论