论文信息 - A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples

A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples

We consider the problem of finding one-variable patterns consistent with given positive examples and negative examples. We try to give some evidence that the pattern finding problem is computationally difficult by finding an NP-complete graph problem (called MCP) such that the pattern finding problem is a subproblem of MCP. We also give sufficient conditions such that the pattern finding problem is polynomial-time computable and show that some of the conditions are related with solving word-equations in one variable.

Takeshi Koshiba | Kunihiko Hiraishi

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Wojciech Plandowski,et al. Two-variable word equations , 2000, RAIRO Theor. Informatics Appl..

[3] Ker-I Ko,et al. A Note on the Two-Variable Pattern-Finding Problem , 1987, J. Comput. Syst. Sci..

[4] Dana Angluin,et al. Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[5] Pavel Goralcik,et al. Efficient Solving of the Word Equations in One Variable , 1994, MFCS.

[6] Witold Charatonik,et al. Word Equations with Two Variables , 1991, IWWERT.

[7] M. Lothaire,et al. Combinatorics on words: Frontmatter , 1997 .

[8] Tao Jiang,et al. Decision Problems for Patterns , 1995, J. Comput. Syst. Sci..

[9] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[10] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[11] Wen-Guey Tzeng,et al. Learning String Patterns and Tree Patterns from Examples , 1990, ML.