On characteristic sets and degrees of finite automata. - Keisuke Tanatsugu; Setsuo Arikawa (Int. J. Parallel Program., 1977)

A Run-Time Efficient Realization of Aho-Corasick Pattern Matching Machines. - Setsuo Arikawa; Takeshi Shinohara (New Gener. Comput., 1984)

Efficient pattern matching algorithms and their applications to text information systems. - Setsuo Arikawa; Takeshi Shinohara (RIAO, 1985)

Reasoning by Analogy as a Partial Identity Between Models. - Makoto Haraguchi; Setsuo Arikawa (AII, 1986)

A Foundation of Reasoning by Analogy: Analogical Union of Logic Programs. - Makoto Haraguchi; Setsuo Arikawa (LP, 1986)

Pseudo Extension in Default Reasoning and Belief Revision by Model Inference. - Hiroko Yuasa; Setsuo Arikawa (LP, 1988)

Elementary Formal System as a Unifying Framework for Language Learning. - Setsuo Arikawa; Takeshi Shinohara; Akihiro Yamamoto (COLT, 1989)

Time-Bounded Reasoning in First Order Knowledge Base Systems. - Yihua Shi; Setsuo Arikawa (LP, 1989)

More About Learning Elementary Formal Systems. - Setsuo Arikawa; Takeshi Shinohara; Satoru Miyano; Ayumi Shinohara (Nonmonotonic and Inductive Logic, 1991)

Introduction: Special Issue on Algorithmic Learning Theory. - Setsuo Arikawa (New Gener. Comput., 1991)

Learning Elementary Formal Systems. - Setsuo Arikawa; Takeshi Shinohara; Akihiro Yamamoto (Theor. Comput. Sci., 1992)

Inductive Inference Machines That Can Refute Hypothesis Spaces. - Yasuhito Mukouchi; Setsuo Arikawa (ALT, 1993)

A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. - Setsuo Arikawa; Satoru Miyano; Ayumi Shinohara; Satoru Kuhara; Yasuhito Mukouchi; Takeshi Shinohara (New Gener. Comput., 1993)

Explanation-Based Reuse of Prolog Programs. - Yasuyuki Koga; Eiju Hirowatari; Setsuo Arikawa (AII/ALT, 1994)

Partially Isomorphic Generalization and Analogical Reasoning. - Eizyu Hirowatari; Setsuo Arikawa (ECML, 1994)

Pattern Inference. - Takeshi Shinohara; Setsuo Arikawa (GOSLER Final Report, 1995)

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. - Takayoshi Shoudai; Michael Lappe; Satoru Miyano; Ayumi Shinohara; Takeo Okazaki; Setsuo Arikawa; Tomoyuki Uchida; Shinichi Shimozono; Takeshi Shinohara; Satoru Kuhara (ISMB, 1995)

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. - Setsuo Arikawa; Masako Sato; Ayumi Shinohara; Takeshi Shinohara (Machine Intelligence 15, 1995)

Towards a Mathematical Theory of Machine Discovery from Facts. - Yasuhito Mukouchi; Setsuo Arikawa (Theor. Comput. Sci., 1995)

Inferability of Recursive Real-Valued Functions. - Eiju Hirowatari; Setsuo Arikawa (ALT, 1997)

Special Issue on Algorithmic Learning Theory. - Setsuo Arikawa; Michael M. Richter (New Gener. Comput., 1997)

A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. - Hiroki Arimura; Atsushi Wataki; Ryoichi Fujino; Setsuo Arikawa (ALT, 1998)

Multiple Pattern Matching in LZW Compressed Text. - Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Masamichi Miyazaki; Setsuo Arikawa (Data Compression Conference, 1998)

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. - Hiroki Arimura; Atsushi Wataki; Ryoichi Fujino; Shinichi Shimozono; Setsuo Arikawa (Discovery Science, 1998)

Discovery of Differential Equations from Numerical Data. - Koichi Niijima; Hidemi Uchida; Eiju Hirowatari; Setsuo Arikawa (Discovery Science, 1998)

Shift-And Approach to Pattern Matching in LZW Compressed Text. - Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 1999)

Pattern Matching in Text Compressed by Using Antidictionaries. - Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 1999)

A Road to Discovery Science (Abstract). - Setsuo Arikawa (RSFDGrC, 1999)

A Unifying Framework for Compressed Pattern Matching. - Takuya Kida; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (SPIRE/CRIWG, 1999)

On the Inductive Inference of Recursive Real-Valued Functions. - Kalvis Apsitis; Setsuo Arikawa; Rusins Freivalds; Eiju Hirowatari; Carl H. Smith (Theor. Comput. Sci., 1999)

Speeding Up Pattern Matching by Text Compression. - Yusuke Shibata; Takuya Kida; Shuichi Fukamachi; Masayuki Takeda; Ayumi Shinohara; Takeshi Shinohara; Setsuo Arikawa (CIAC, 2000)

A Boyer-Moore Type Algorithm for Compressed Pattern Matching. - Yusuke Shibata; Tetsuya Matsumoto; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 2000)

Identification of Tree Translation Rules from Examples. - Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (ICGI, 2000)

Learning Term Rewriting Systems from Entailment . - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (ILP Work-in-progress reports, 2000)

Text Data Mining: Discovery of Important Keywords in the Cyberspace. - Hiroki Arimura; Jun-ichiro Abe; Hiroshi Sakamoto; Setsuo Arikawa; Ryoichi Fujino; Shinichi Shimozono (Kyoto International Conference on Digital Libraries, 2000)

Putting Old Data into New System: Web-Based Catalog Card Image Searching. - Toshiro Minami; Hidekazu Kurita; Setsuo Arikawa (Kyoto International Conference on Digital Libraries, 2000)

Discovering Unordered and Ordered Phrase Association Patterns for Text Mining. - Ryoichi Fujino; Hiroki Arimura; Setsuo Arikawa (PAKDD, 2000)

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. - Masahiro Hirao; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2000)

Online Construction of Subsequence Automata for Multiple Texts. - Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2000)

Bit-Parallel Approach to Approximate String Matching in Compressed Texts. - Tetsuya Matsumoto; Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (SPIRE, 2000)

Special Feature on Discovery Science. - Hiroshi Motoda; Setsuo Arikawa (New Gener. Comput., 2000)

Efficient Discovery of Optimal Word-Association Patterns in Large Text Databases. - Shinichi Shimozono; Hiroki Arimura; Setsuo Arikawa (New Gener. Comput., 2000)

The Discovery Science Project in Japan. - Setsuo Arikawa (ALT, 2001)

Efficient Learning of Semi-structured Data from Queries. - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (ALT, 2001)

Efficient Discovery of Proximity Patterns with Suffix Arrays. - Hiroki Arimura; Hiroki Asaka; Hiroshi Sakamoto; Setsuo Arikawa (CPM, 2001)

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications. - Toru Kasai; Gunho Lee; Hiroki Arimura; Setsuo Arikawa; Kunsoo Park (CPM, 2001)

Multiple Pattern Matching Algorithms on Collage System. - Takuya Kida; Tetsuya Matsumoto; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 2001)

Compressed Pattern Matching for SEQUITUR. - Shuichi Mitarai; Masahiro Hirao; Tetsuya Matsumoto; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Data Compression Conference, 2001)

Faster Approximate String Matching over Compressed Text. - Gonzalo Navarro 001; Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (Data Compression Conference, 2001)

A Practical Algorithm to Find the Best Episode Patterns. - Masahiro Hirao; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2001)

Mining Semi-structured Data by Path Expressions. - Katsuaki Taniguchi; Hiroshi Sakamoto; Hiroki Arimura; Shinichi Shimozono; Setsuo Arikawa (Discovery Science, 2001)

Extracting Partial Structures from HTML Documents. - Hiroshi Sakamoto; Yoshitsugu Murakami; Hiroki Arimura; Setsuo Arikawa (FLAIRS, 2001)

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2001)

Construction of the CDAWG for a Trie. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Stringology, 2001)

A comparison of identification criteria for inductive inference of recursive real-valued functions. - Eiju Hirowatari; Setsuo Arikawa (Theor. Comput. Sci., 2001)

The Minimum DAWG for All Suffixes of a String and Its Applications. - Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara; Hiromasa Hoshino; Setsuo Arikawa (CPM, 2002)

Discovering Best Variable-Length-Don't-Care Patterns. - Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2002)

Efficient Data Mining from Large Text Databases. - Hiroki Arimura; Hiroshi Sakamoto; Setsuo Arikawa (Progress in Discovery Science, 2002)

Knowledge Discovery from Semistructured Texts. - Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (Progress in Discovery Science, 2002)

Finding Best Patterns Practically. - Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Masahiro Hirao; Hiromasa Hoshino; Shunsuke Inenaga (Progress in Discovery Science, 2002)

Online Algorithms for Mining Semi-structured Data Stream. - Tatsuya Asai; Hiroki Arimura; Kenji Abe; Shinji Kawasoe; Setsuo Arikawa (ICDM, 2002)

Space-Economical Construction of Index Structures for All Suffixes of a String. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Hideo Bannai; Setsuo Arikawa (MFCS, 2002)

Optimized Substructure Discovery for Semi-structured Data. - Kenji Abe; Shinji Kawasoe; Tatsuya Asai; Hiroki Arimura; Setsuo Arikawa (PKDD, 2002)

Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. - Masayuki Takeda; Satoru Miyamoto; Takuya Kida; Ayumi Shinohara; Shuichi Fukamachi; Takeshi Shinohara; Setsuo Arikawa (SPIRE, 2002)

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. - Masayuki Takeda; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Setsuo Arikawa (Discovery Science, 2003)

A Note on Randomized Algorithm for String Matching with Mismatches. - Kensuke Baba; Ayumi Shinohara; Masayuki Takeda; Shunsuke Inenaga; Setsuo Arikawa (Nord. J. Comput., 2003)

Preface. - Setsuo Arikawa; Koichi Furukawa; Shinichi Morishita; Hiroshi Motoda (Theor. Comput. Sci., 2003)

A practical algorithm to find the best subsequence patterns. - Masahiro Hirao; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Theor. Comput. Sci., 2003)

Collage system: a unifying framework for compressed pattern matching. - Takuya Kida; Tetsuya Matsumoto; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (Theor. Comput. Sci., 2003)

Efficient Algorithms for Finding Frequent Substructures from Semi-structured Data Streams. - Tatsuya Asai; Kenji Abe; Shinji Kawasoe; Hiroki Arimura; Setsuo Arikawa (JSAI Workshops, 2004)

Efficient Substructure Discovery from Large Semi-Structured Data. - Tatsuya Asai; Kenji Abe; Shinji Kawasoe; Hiroshi Sakamoto; Hiroki Arimura; Setsuo Arikawa (IEICE Trans. Inf. Syst., 2004)

Compact directed acyclic word graphs for a sliding window. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (J. Discrete Algorithms, 2004)

On-line construction of compact directed acyclic word graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi (Discret. Appl. Math., 2005)

Refutability and Reliability for Inductive Inference of Recursive Real-Valued Functions. - Eiju Hirowatari; Kouichi Hirata; Tetsuhiro Miyahara; Setsuo Arikawa (Inf. Media Technol., 2006)