Developments from enquiries into the learnability of the pattern languages from positive data

Theoretical Computer Science ◽

10.1016/j.tcs.2008.02.028 ◽

2008 ◽

Vol 397 (1-3) ◽

pp. 150-165 ◽

Author(s):

Yen Kaow Ng ◽

Takeshi Shinohara

Keyword(s):

Pattern Languages ◽

Download Full-text

Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data

Lecture Notes in Computer Science - STACS 94 ◽

10.1007/3-540-57785-8_178 ◽

1994 ◽

pp. 647-660 ◽

Author(s):

Hiroki Arimura ◽

Takeshi Shinohara ◽

Setsuko Otsuki

Keyword(s):

Inductive Inference ◽

Pattern Languages ◽

Download Full-text

Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data

Inductive Logic Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-31951-8_32 ◽

2012 ◽

pp. 389-404 ◽

Author(s):

Yuta Yoshimura ◽

Takayoshi Shoudai ◽

Yusuke Suzuki ◽

Tomoyuki Uchida ◽

Tetsuhiro Miyahara

Keyword(s):

Polynomial Time ◽

Inductive Inference ◽

Pattern Languages ◽

Download Full-text

Inductive inference of unbounded unions of pattern languages from positive data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/3-540-61863-5_51 ◽

1996 ◽

pp. 256-271 ◽

Author(s):

Takeshi Shinohara ◽

Hiroki Arimura

Keyword(s):

Inductive Inference ◽

Pattern Languages ◽

Download Full-text

Inductive inference of unbounded unions of pattern languages from positive data

Theoretical Computer Science ◽

10.1016/s0304-3975(99)00270-4 ◽

2000 ◽

Vol 241 (1-2) ◽

pp. 191-209 ◽

Author(s):

Takeshi Shinohara ◽

Hiroki Arimura

Keyword(s):

Inductive Inference ◽

Pattern Languages ◽

Download Full-text

Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/11894841_13 ◽

2006 ◽

pp. 124-138 ◽

Author(s):

Matthew de Brecht ◽

Akihiro Yamamoto

Keyword(s):

Pattern Languages ◽

Download Full-text

Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

Theoretical Computer Science ◽

10.1016/j.tcs.2009.11.004 ◽

2010 ◽

Vol 411 (7-9) ◽

pp. 976-985 ◽

Author(s):

Matthew de Brecht ◽

Akihiro Yamamoto

Keyword(s):

Pattern Languages ◽

Positive Data ◽

Restricted Pattern

Download Full-text

Learning k-variable pattern languages efficiently stochastically finite on average from positive data

Grammatical Inference - Lecture Notes in Computer Science ◽

10.1007/bfb0054060 ◽

1998 ◽

pp. 13-24 ◽

Author(s):

Peter Rossmanith ◽

Thomas Zeugmann

Keyword(s):

Pattern Languages ◽

Variable Pattern ◽

Download Full-text

Proceedings of the 24th European Conference on Pattern Languages of Programs - EuroPLop '19

10.1145/3361149 ◽

2019 ◽

Keyword(s):

Pattern Languages ◽

European Conference

Download Full-text

Describing Pattern Languages for Checking Design Models

2009 16th Asia-Pacific Software Engineering Conference ◽

10.1109/apsec.2009.38 ◽

2009 ◽

Author(s):

Bahman Zamani ◽

Greg Butler

Keyword(s):

Pattern Languages ◽

Download Full-text

Finding solutions through pattern languages

Computer ◽

10.1109/2.335755 ◽

1994 ◽

Vol 27 (12) ◽

pp. 75-76 ◽

Author(s):

S. Berczuk

Keyword(s):

Pattern Languages

Download Full-text