Inferring Strings from Graphs and Arrays.
Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings,
Lecture Notes in Computer Science Vol.2747, pp.208-217
(2003), [peer-reviewed]
Event Date:
August 25-29, 2003
Abstract / 概要
This paper introduces a new problem of inferring strings from graphs, and inferring strings from arrays. Given a graph G or an array A, we infer a string that suits the graph, or the array, under some condition. Firstly, we solve the problem of finding a string w…