Hilbert's tenth problem
Cornerstones of undecidability
Cornerstones of undecidability
Journal of the ACM (JACM)
Handbook of Formal Languages
Subword histories and Parikh matrices
Journal of Computer and System Sciences
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Inferring a graph from path frequency
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
On computational complexity of graph inference from counting
Natural Computing: an international journal
| Hi-index | 5.23 |
In a given word, one can count the number of occurrences of other words as a scattered subword. These counts can be ''added'' and/or ''multiplied.'' A subword history gives an instruction of what words to be counted and how these counts to be added and multiplied with other counts or integer constants, and hence, determines its unique value in a given word. Mateescu, Salomaa, and Yu asked: ''is it decidable whether the value of a given subword history is non-negative in all words over a given alphabet?'' (absoluteness problem). Another important problem is of whether there exists a word in which the value of a given subword history becomes 0 (equality problem). In this paper, we prove the undecidability of the equality problem and show that the equality problem is polynomial-time Karp reducible to the absoluteness problem; thus, the absoluteness problem is also undecidable. This approach solves the open problem actually under stronger conditions than supposed originally.