| 2013 | ||
|---|---|---|
| c5 | Katsuhiko Nakamura, Keita Imada: Eliminating Stack Symbols in Push-Down Automata and Linear Indexed Grammars. LATA 2013: 444-455 | |
| 2011 | ||
| c4 | Katsuhiko Nakamura, Keita Imada: Towards Incremental Learning of Mildly Context-Sensitive Grammars. ICMLA (1) 2011: 223-228 | |
| 2010 | ||
| j1 | Keita Imada, Katsuhiko Nakamura: Search for Minimal and Semi-Minimal Rule Sets in Incremental Learning of Context-Free and Definite Clause Grammars. IEICE Transactions 93-D(5): 1197-1204 (2010) | |
| c3 | Katsuhiko Nakamura, Keita Imada: Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages. Discovery Science 2010: 117-131 | |
| 2009 | ||
| c2 | Keita Imada, Katsuhiko Nakamura: Learning Context Free Grammars by Using SAT Solvers. ICMLA 2009: 267-272 | |
| 2008 | ||
| c1 | Keita Imada, Katsuhiko Nakamura: Towards Machine Learning of Grammars and Compilers of Programming Languages. ECML/PKDD (2) 2008: 98-112 | |
| 1 | Katsuhiko Nakamura |
Data released under the ODC-BY 1.0 license — See also our legal information page