Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data

Term graphs are a kind of hypergraphs such that arbitrary graphs can be put to the place of their hyperedges. Each hyperedge in a term graph is labeled with a variable. A term graph is called regular if each variable attached to a hyperedge does not occur more than once. Let f be a regular term graph. If a regular term graph which is obtained from f by substituting any tree becomes also a tree, f is called a regular term tree. We study polynomial time inductive inference of regular term tree languages. This graph language is an extension of pattern languages of strings. We show that some classes of regular term tree languages of term caterpillars are polynomial time inductive inferable.

[1]  John Shawe-Taylor,et al.  The Complexity of Learning Minor Closed Graph Classes , 1995, ALT.

[2]  J. van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[3]  Takeshi Shinohara.  Some problems on inductive inference from positive data , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

[4]  Assaf Marron,et al.  Learning pattern languages from a single initial example and from queries , 1988, Annual Conference Computational Learning Theory.

[5]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[6]  内田 智之.  Formal graph systems and parallel graph algorithm design , 1994 .

[7]  篠原 武.  Studies on inductive inference from positive data , 1986 .

[8]  Satoru Miyano,et al.  Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete , 1994, MFCS.

[9]  Jan van Leeuwen,et al.  Graph Algorithms , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[11]  Sei'ichi Tani,et al.  Learning of Restricted RNLC Graph Languages , 1995, ISAAC.

[12]  Thomas Lengauer,et al.  An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures , 1996, J. Comput. Biol..

[13]  R. Nussinov,et al.  Tree graphs of RNA secondary structures and their comparisons. , 1989, Computers and biomedical research, an international journal.

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